A branch, bound, and remember algorithm for the 1|r i |σt i scheduling problem

Journal of Scheduling

Volumn 12, Issue 2, 2009, Pages 163-175

  Kao, Gio K ^a   Sewell, Edward C ^b   Jacobson, Sheldon H ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b SOUTHERN ILLINOIS UNIVERSITY EDWARDSVILLE   (United States)

Author keywords

Branch and bound algorithms; Dynamic programming; Scheduling theory and algorithms

Indexed keywords

BEST-FIRST SEARCHES; BEST-KNOWN ALGORITHMS; BRANCH AND BOUND ALGORITHMS; BRANCH AND BOUNDS; COMPUTATIONAL RESULTS; DYNAMIC PROGRAMMING ALGORITHMS; EXPLORATION STRATEGIES; LOWER BOUNDS; SCHEDULING PROBLEMS; SCHEDULING THEORY AND ALGORITHMS; SINGLE MACHINE SCHEDULING PROBLEMS; TOTAL TARDINESS;

CONTROL THEORY; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MACHINERY; SCHEDULING; SYSTEMS ENGINEERING;

SCHEDULING ALGORITHMS;

EID: 63149132070     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0087-3     Document Type: Article

References (21)

1. P. Baptiste J. Carlier A. Jouglet 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
2. P. Baptiste L. Peridy E. Pinson 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
3. Bedworth, D., & Bailey, J. (1987). Integrated production control systems: management, analysis, design. New York: Wiley.
4. Brucker, P. (1999). Scheduling algorithms, 2nd edn. Heidelberg: Springer.
5. S. Chang Q. Lu G. Tang W. Yu 1995 On decomposition of the total tardiness problem Operations Research 17 221 229
6. C. Chu 1992 A branch-and-bound algorithm to minimize total tardiness with different release dates Naval Research Logistics 39 265 283
7. i scheduling problem European Journal of Operational Research 58 404 413
8. S. Dauzère-Pérès M. Sevaux 2004 An exact method to minimize the number of tardy jobs in single machine scheduling Journal of Scheduling 7 405 420
9. J. Du J.Y.-T. Leung 1990 Minimizing total tardiness on one machine is NP-hard Mathematics of Operations Research 15 483 495
10. H. Emmons 1969 One-machine sequencing to minimize certain function of job tardiness Operations Research 17 701 715
11. Garfinkel, R., & Nemhauser, G. (1972). Integer programming. New York: Wiley.
12. R. Graham E. Lawler J. Lenstra A. Rinnooy Kan 1979 Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 287 326
13. 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.
14. i scheduling problem (Technical Report). Department of Computer Science, University of Illinois at Urbana Champaign.
15. E. L. Lawler 1977 A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness Annals of Discrete Mathematics 1 331 342
16. C. N. Potts L. N. Van Wassenhove 1982 A decomposition algorithm for the single machine total tardiness problem Operations Research Letters 26 177 182
17. Rinnooy Kan, A. (1976). Machine scheduling problem: classification, complexity and computations. Hague: Nijhoff.
18. Russell, S., & Norvig, P. (1995). Artificial intelligence: a modern approach. Englewood Cliffs: Prentice Hall.
19. Sellers, D. W. 1996. A survey of approaches to the job shop scheduling problem. In 28th Southeastern symposium on system theory (p. 396).
20. W. Szwarc F. Della Croce A. Grosso 1999 Solution of the single-machine total tardiness problem Journal of Scheduling 2 55 71
21. W. Szwarc A. Grosso F. Della Croce 2001 Algorithmic paradoxes of the single-machine total tardiness problem Journal of Scheduling 4 93 104