Abstract
This paper presents a modified Branch and Bound (B&B) algorithm called, the Branch, Bound, and Remember (BB&R) algorithm, which uses the Distributed Best First Search (DBFS) exploration strategy for solving the 1|r i |∑t i scheduling problem, a single machine scheduling problem where the objective is to find a schedule with the minimum total tardiness. Memory-based dominance strategies are incorporated into the BB&R algorithm. In addition, a modified memory-based dynamic programming algorithm is also introduced to efficiently compute lower bounds for the 1|r i |∑t i scheduling problem. Computational results are reported, which shows that the BB&R algorithm with the DBFS exploration strategy outperforms the best known algorithms reported in the literature.
Similar content being viewed by others
References
Baptiste, P., Carlier, J., & Jouglet, A. (2004). A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates. European Journal of Operational Research, 158, 595–608.
Baptiste, P., Peridy, L., & Pinson, E. (2003). A branch and bound to minimize the number of late jobs on a single machine with release time constraints. European Jornal of Operational Research, 144, 1–11.
Bedworth, D., & Bailey, J. (1987). Integrated production control systems: management, analysis, design. New York: Wiley.
Brucker, P. (1999). Scheduling algorithms, 2nd edn. Heidelberg: Springer.
Chang, S., Lu, Q., Tang, G., & Yu, W. (1995). On decomposition of the total tardiness problem. Operations Research, 17, 221–229.
Chu, C. (1992). A branch-and-bound algorithm to minimize total tardiness with different release dates. Naval Research Logistics, 39, 265–283.
Chu, C., & Portmann, M. C. (1992). Some new efficient methods to solve the n|1|r i |∑t i scheduling problem. European Journal of Operational Research, 58, 404–413.
Dauzère-Pérès, S., & Sevaux, M. (2004). An exact method to minimize the number of tardy jobs in single machine scheduling. Journal of Scheduling, 7, 405–420.
Du, J., & Leung, J.Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483–495.
Emmons, H. (1969). One-machine sequencing to minimize certain function of job tardiness. Operations Research, 17, 701–715.
Garfinkel, R., & Nemhauser, G. (1972). Integer programming. New York: Wiley.
Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326.
Jouglet, A., Baptiste, P., & Carlier, J. (2004). Branch-and-bound algorithms for total weighted tardiness. In J.Y.–T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: CRC Press.
Kao, G. K., Sewell, E. C., Jacobson, S. H., & Hall, S. N. 2008. The distributed best first search exploration strategy: an illustrative example with the 1|r i |∑U i scheduling problem (Technical Report). Department of Computer Science, University of Illinois at Urbana Champaign.
Lawler, E. L. (1977). A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331–342.
Potts, C. N., & Van Wassenhove, L. N. (1982). A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 26, 177–182.
Rinnooy Kan, A. (1976). Machine scheduling problem: classification, complexity and computations. Hague: Nijhoff.
Russell, S., & Norvig, P. (1995). Artificial intelligence: a modern approach. Englewood Cliffs: Prentice Hall.
Sellers, D. W. 1996. A survey of approaches to the job shop scheduling problem. In 28th Southeastern symposium on system theory (p. 396).
Szwarc, W., Della Croce, F., & Grosso, A. (1999). Solution of the single-machine total tardiness problem. Journal of Scheduling, 2, 55–71.
Szwarc, W., Grosso, A., & Della Croce, F. (2001). Algorithmic paradoxes of the single-machine total tardiness problem. Journal of Scheduling, 4, 93–104.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kao, G.K., Sewell, E.C. & Jacobson, S.H. A branch, bound, and remember algorithm for the 1|r i |∑t i scheduling problem. J Sched 12, 163–175 (2009). https://doi.org/10.1007/s10951-008-0087-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-008-0087-3