Dominance-based heuristics for one-machine total cost scheduling problems

European Journal of Operational Research

Volumn 184, Issue 3, 2008, Pages 879-899

  Jouglet, Antoine ^a   Savourey, David ^a   Carlier, Jacques ^a   Baptiste, Philippe ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Heuristics; Scheduling; Single machine

Indexed keywords

COST BENEFIT ANALYSIS; HEURISTIC PROGRAMMING; LOGIC PROGRAMMING; PROBLEM SOLVING;

HEURISTIC SOLUTIONS; SINGLE MACHINES;

SCHEDULING;

EID: 34548586925     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.11.036     Document Type: Article

References (23)

1. Akturk M.S., and Ozdemir D. An exact approach to minimizing total weighted tardiness with release dates. IIE Transactions 32 (2000) 1091-1101
2. Akturk M.S., and Ozdemir D. A new dominance rule to minimize total weighted tardiness with unequal release dates. European Journal of Operational Research 135 (2001) 394-412
3. Baker K.R. Introduction to Sequencing and Scheduling (1974), John Wiley and Sons
4. Baptiste Ph., Carlier J., and Jouglet A. A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates. European Journal of Operational Research 158 3 (2004) 595-608
5. Belouadah H., Posner M.E., and Potts C.N. Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics 36 (1992) 213-231
6. Chand S., Traub R., and Uzsoy R. An iterative heuristic for the single-machine dynamic total completion time scheduling problem. Computers and Operations Research 23 (1996) 641-651
7. Chand S., Traub R., and Uzsoy R. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Annals of Operations Research 70 (1997) 115-125
8. Chu C. A branch and bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics 39 (1991) 859-875
9. Chu C. A branch and bound algorithm to minimize total tardiness with different release dates. Naval Research Logistics 39 (1992) 265-283
10. Chu C. Efficient heuristics to minimize total flow time with release dates. Operations Research Letters 12 (1992) 321-330
11. i scheduling problem. European Journal of Operational Research 58 (1991) 404-413
12. Congram R.K., Potts C.N., and Van De Velde S.L. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14 (2002) 52-67
13. Conway R.W., Maxwell W.C., and Miller L.W. Theory of Scheduling (1967), Addison Wesley, Reading, MA
14. Della Croce F., and T'kindt V. A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. Journal of the Operational Research Society 53 (2002) 1275-1280
15. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13 (1986) 533-549
16. Glover F., and Laguna M. Tabu Search (1998), Kluwer Academic Publishers
17. Hariri A.M.A., and Potts C.N. An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics 5 (1983) 99-109
18. Jouglet A., Baptiste Ph., and Carlier J. Branch and bound algorithms for total weighted tardiness. In: Leung J. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press (Chapter 13)
19. Kanet J.J., and Zhou Z. A decision theory approach to priority dispatching for job shop scheduling. Production and Operations Management 2 1 (1993) 2-14
20. Morton T.E., and Ramnath P. Guided forward search in tardiness scheduling of large one machine problems. Intelligent Scheduling System (1995), Kluwer Academic Publishers, Hingham, MA
21. Rinnooy Kan A.H.G. Machine Sequencing Problem: Classification, Complexity and Computation (1976), Nijhoff, The Hague
22. Smith W.E. Various optimizers for single stage production. Naval Research Logistics Quarterly 3 (1956) 59-66
23. Vepsalainen A.P.J., and Morton T.E. Priority rules for job shops with weighted tardiness costs. Management Science 39 5 (1993) 626-632