A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Computers and Operations Research

Volumn 35, Issue 8, 2008, Pages 2599-2616

  Essafi, Imen ^a   Mati, Yazid ^b   Dauzère Pérès, Stéphane ^c  

^a CNRS   (France)

^b QASSIM UNIVERSITY   (Saudi Arabia)

^c Center Microelectronics De Provence Georges Charpak   (France)

Author keywords

Hybrid genetic algorithm; Job shop scheduling; Local search; Total weighted tardiness

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

GRAPH MODEL; ITERATED LOCAL SEARCH; SEARCH ALGORITHMS;

SEARCH ENGINES;

EID: 37049003027     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.12.019     Document Type: Article

References (25)

1. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
2. Jain A.S., and Meeran S. Deterministic job-shop scheduling: past, present and future. European Journal of Operational Research 113 2 (1999) 390-434
3. Van Laarhoven P.J.M., Aarts E.H.L., and Lenstra J.K. Job shop scheduling by simulated annealing. Operations Research 40 1 (1992) 113-125
4. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science 42 6 (1996) 797-813
5. Lourenco H.R. Job-shop scheduling: computational study of local search and large-step optimization methods. European Journal of Operational Research 83 (1995) 347-364
6. Volta R., Della Croce G., and Tadei F. A genetic algorithm for the job shop scheduling problem. Computers and Operations Research 22 (1995) 15-24
7. Goncalves J.F., Mendes J.J.M., and Resende M.G.C. A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167 (2005) 77-95
8. Yamada T., and Nakano R. Genetic algorithms for job shop scheduling problems. Proceedings of modern heuristic for decision support (1997) 67-81
9. Vepsalainen A.P.J., and Morton T.E. Priority rules for job shops with weighted tardiness costs. Management Science 33 (1985) 585-596
10. Pinedo M., and Singer M. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics 46 (1999) 1-17
11. Armentano V.A., and Scrich C.R. Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics 63 (2000) 131-140
12. Kreipl S. A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling 3 3 (2000) 125-138
13. Mattfeld D.C., and Bierwirth C. An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research 155 (2004) 616-630
14. Singer M. Decomposition methods for large job shops. Computers and Operations Research 28 (2001) 193-207
15. Singer M., and Pinedo M. A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions 30 (1998) 109-118
16. Portmann M.C. Genetic algorithms scheduling: a state of the art and some propositions. Proceedings of the workshop on production planning and control, Mons, Belgium (1996)
17. Falkenauer E., and Bouffoix S. A genetic algorithm for job shop. Proceedings of the 1991 IEEE international conference on robotics and automation (1991)
18. Dorndorf U., and Pesch E. Evolution based learning in a job shop scheduling environment. Computers and Operations Research 22 (1995) 25-40
19. Storer R.H., Wu D.S., and Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Management Science 38 10 (1992) 1495-1509
20. Giffler B., and Thompson G. Algorithms for solving production scheduling problems. Operations Research 8 (1960) 487-503
21. Roy M, Sussmann M. Les problèmes d'ordonnancement avec contraintes disjonctives, SEMA Notes DS, Paris, 9, 1969.
22. Taillard E.D. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6 2 (1994) 108-117
23. Mati Y, Dauzére-Pérès S, Lahlou C. A general approach for optimizing regular criteria in the job shop scheduling problem. Research Report, Ecole des Mines de Nantes, 2005.
24. Lawrence S. Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical Report, Carnegie-Mellon University, Pittsburgh, 1984.
25. Liaw C.F. A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operational Research 124 (2000) 28-42