A memetic algorithm for the job-shop with time-lags

Computers and Operations Research

Volumn 35, Issue 7, 2008, Pages 2331-2356

  Caumond, Anthony ^a   Lacomme, Philippe ^a   Tchernev, Nikolay ^a,b  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Job shop problem; Scheduling; Time lags

Indexed keywords

OPERATIONS RESEARCH; PROBLEM SOLVING; TIME DELAY;

JOB-SHOP PROBLEMS; TIME-LAGS;

LEARNING ALGORITHMS;

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

References (29)

1. Riezebos J., and Gaalman G.J.C. Time lag size in multiple operations flow shop scheduling heuristics. European Journal of Operational Research 105 1 (1998) 72-90
2. Brucker P., Hilbig T., and Hurink J. A branch and bound algorithm for a single machine scheduling with positive and negative time-lags. Discrete Applied Mathematics 94 (1999) 77-99
3. Rebaine D., and Strusevich V.A. Two-machine open shop scheduling with special transportation times. Journal of the Operational Research Society 50 (1999) 756-764
4. Wikum E.D., Llewellynn D.C., and Nemhauser G.L. One-machine generalized precedence constrained scheduling problem. Operations Research Letters 16 (1994) 87-99
5. Finta L., and Liu Z. Single machine scheduling subject to precedence delays. Discrete Applied Mathematics 70 (1996) 247-266
6. Yang D.L., and Chern M.S. A two-machine flowshop sequencing problem with limited waiting time constraints. Computers and Industrial Engineering 28 1 (1995) 63-70
7. Bartusch M., Mohring R.H., and Rademacher F.J. Scheduling project networks with resource constraints and time windows. Annals of Operations Research I6 (1988) 201-240
8. Brinkmann K., and Neumann K. Heuristic procedures for resource-constrained project scheduling with minima1 and maxima1 time lags: the minimum project-duration and resource-levelling problems. Journal of Decision Systems 5 (1996) 129-156
9. Botta-Genoulaz V. Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. International Journal of Production Economics 64 1-3 (2000) 101-111
10. Fondrevelle J., Oulamara A., and Portmann M.C. Permutation flowshop scheduling problems with maximal and minimal time lags. Computers and Operations Research 33 6 (2006) 1540-1556
11. Caumond A., Gourgand M., Lacomme P., and Tchernev N. Métaheuristiques pour le problème du job-shop avec time-lags. Actes de MOSIM'04. Nantes 2 (2004) 939-946
12. Caumond A, Lacomme P, Tchernev N. Proposition d'un algorithme génétique pour le job-shop avec time-lags. ROADEF'05, Tours, 2005, p. 183-200.
13. Haupt R. A survey of Priority Rule-Based Scheduling. OR Spektrum 11 (1989) 3-16
14. Deppner F. Ordonnancement d'atelier avec contraintes temporelles entre opérations. PhD thesis in French, LORIA Nancy, France, 2004.
15. Giffler B., and Thompson J.L. Algorithms for solving production scheduling problems. Operations Research 8 (1960) 487-503
16. Brucker P. Scheduling Algorithms. 3rd ed (2001), Springer, Berlin
17. Mascis A., and Pacciarelli D. Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143 (2002) 498-517
18. Manne A.S. On the job-shop scheduling problem. Operations Research 8 2 (1960) 219-223
19. Roy B, Sussmann B. Les problèmes d'ordonnancement avec contraintes disjonctives, Note DS no. 9 bis, SEMA, Paris, 1964.
20. Bierwirth C. A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spektrum 17 (1995) 87-92
21. Wirth N. Algorithms + data structures = Programs. Prentice Hall Series in Automatic Computation, 1976.
22. Levy G. Algorithmique Combinatoire: methodes constructuves (1994), Dunod, Paris
23. Kaplan, Haim, Tarjan, Robert E. New heap data structures. Technical Report TR-597-99, Princeton University. 〈http://www.cs.princeton.edu/research/techreps/TR-597-99〉; 1999.
24. Reddy US, Yang H. Correctness of data representations involving heap data structures. Proceedings of ESOP 223-37, 2003.
25. Caumond A, Lacomme P, Tchernev N. Feasible schedules generation with an extension of the Giffler and Thomson algorithm for the jobshop with timelags. In: International conference on industrial engineering and system management, Marrakech-Morocco, 2005.
26. 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
27. Cormen T.H., Leiserson C.L., and Rivest M.L. Introduction to algorithms (1990), MIT Press, Cambridge, MA
28. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 1 (1995) 5-13
29. Schuster C.J., and Framinan J.M. Approximative procedures for no-wait job shop scheduling. Operations Research Letters 31 (2003) 308-318