Two simulated annealing-based heuristics for the job shop scheduling problem

European Journal of Operational Research

Volumn 118, Issue 3, 1999, Pages 524-548

  Steinhofel K ^a   Albrecht, A ^b,c   Wong, C K ^b,d  

^a FRAUNHOFER FIRST   (Germany)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c BerCom GmbH   (Germany)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; CRITICAL PATH ANALYSIS; HEURISTIC METHODS; OPERATIONS RESEARCH; PROBABILITY DISTRIBUTIONS; SCHEDULING; SIMULATED ANNEALING;

JOB SHOP SCHEDULING;

JOB ANALYSIS;

EID: 0344614598     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00326-9     Document Type: Article

References (51)

1. E.H.L. Aarts, Local Search in Combinatorial Optimization. Wiley, New York, 1998.
2. E.H.L. Aarts, J.H.M. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach. Wiley, New York, 1989.
3. E.H.L. Aarts, P.J.M. Van Laarhoven, J.K. Lenstra, N.L.J. Ulder, A computational study of local search algorithms for shop scheduling, ORSA Journal on Computing 6 (1994) 118-125.
4. J. Adams, E. Balas, D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science 34 (1988) 391-401.
5. A. Albrecht, S.K. Cheung, K.C. Hui, K.S. Leung, C.K. Wong, Optimal placements of flexible objects (Part I: The unbounded case), IEEE Transactions on Computers 46 (8) (1997) 890-904.
6. A. Albrecht, S.K. Cheung, K.C. Hui, K.S. Leung, C.K. Wong, Optimal placements of flexible objects (Part II: A simulated annealing approach for the bounded case), IEEE Transactions on Computers 46 (8) (1997) 905-929.
7. A. Albrecht, S.K. Cheung, K.S. Leung, C.K. Wong, Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds, Mathematics and Computers in Simulation 44 (2) (1997) 187-215.
8. A. Albrecht, S.K. Cheung, K.S. Leung, C.K. Wong, Stochastic simulations of two-dimensional composite packings, Journal of Computational Physics 136 (2) (1997) 559-579.
9. D. Applegate, W. Cook, A computational study of job-shop scheduling, ORSA Journal on Computing 3 (2) (1991) 149-156.
10. E. Balas, Machine sequencing via disjunctive graphs: An implicit enumeration algorithm, Operations Research 17 (1969) 941-957.
11. J.C. Bean, Genetics and random keys for sequencing and optimization, ORSA Journal on Computing 6 (1994) 154-160.
12. J.L. Bruno, E.G. Coffman Jr., P.R. Winters (Eds.), Computer and Job Shop Scheduling Theory. Wiley, New York, 1976.
13. J. Carlier, E. Pinson, An algorithm for solving the job-shop problem, Management Science 35 (1989) 164-176.
14. V. Černy, A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm, Preprint, Institute of Physics and Biophysics, Comenius University, Bratislava, 1982 (see also: J. Optim. Theory Appl. 45 (1985) 41-51).
15. V. Černy, A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm, Preprint, Institute of Physics and Biophysics, Comenius University, Bratislava, 1982 (see also: J. Optim. Theory Appl. 45 (1985) 41-51).
16. E.G. Coffman Jr., L. Flatto, P.E. Wright, Optimal stochastic allocation of machines under waiting-time constraints, SIAM Journal on Computing 22 (2) (1993) 332-348.
17. H.A.J. Crauwels, C.N. Potts, L.N. Van Wassenhove, Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time, Annals of Operations Research 70 (1997) 261-280.
18. M. Dell'Amico, M. Trubian, Applying tabu search to the job-shop scheduling problem, Annals of Operations Research 41 (1993) 231-252.
19. L. Finta, Z. Liu, Single Machine Scheduling Subject to Precedence Delays, RR-2198, INRIA, 1994.
20. M.R. Garey, D.S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal on Computing 44 (1975) 397-411.
21. H.J. Goltz, Reducing domains for search in CLP(FD) and its application to job shop scheduling, in: U. Montanari, F. Rossi (Eds.), First International Conference on Principles and Practice of Constraint Programming (CP'95), Lecture Notes in Computer Science, vol. 976, Springer, Cassis, 1995, pp. 549-562.
22. H.J. Goltz, U. John, Methods for solving practical problems of job shop scheduling modelled in CLP(FD), in: M. Wallace (Ed.), PACT'96 - Practical Application of Constraint Technology, London, 1996, pp. 73-92.
23. F. Granot, J. Skorin-Kapov, A. Tamir, Using quadratic programming to solve high multiplicity scheduling problems on parallel machines, Algorithmica 17 (2) (1997) 100-110.
24. J.N.D. Gupta, J.C. Ho, J.A.A. van der Veen, Single machine hierarchical scheduling with customer orders and multiple job classes, Annals of Operations Research 70 (1997) 127-144.
25. B. Hajek, Cooling schedules for optimal annealing, Mathematics of Operations Research 13 (1988) 311-329.
26. A.M.A. Hariri, C.N. Potts, Single machine scheduling with batch set-up times to minimize maximum lateness, Annals of Operations Research 70 (1997) 75-92.
27. J.A. Hoogeveen, J.K. Lenstra, S.L. van de Velde, Sequencing and scheduling: An annotated bibliography, Technical Report COSOR 97-2, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1997.
28. S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
29. G.M. Koole, Stochastic scheduling and dynamic programming. CWI TRACT, vol. 113. CWI, Amsterdam, The Netherlands, 1995.
30. S. Lawrence, Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (Supplement), Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1984.
31. C.Y. Lee, L. Lei (Eds.), Scheduling: Theory and Applications, Annals of Operations Research, vol. 70 (1997).
32. C.Y. Lee, L. Lei, M. Pinedo, Current trends in deterministic scheduling, Annals of Operations Research 70 (1997) 1-41.
33. S.D. Liman, S.S. Panwalkar, S. Thongmee, Single machine scheduling problem with common due window and controllable processing times, Annals of Operations Research 70 (1997) 145-154.
34. Z. Liu, E. Sanlaville, Stochastic scheduling with variable profile and precedence constraints, SIAM Journal on Computing 26 (1) (1997) 173-187.
35. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E. Teller, Equation of state calculations by fast computing machines, The Journal of Chemical Physics 21 (6) (1953) 1087-1092.
36. J.F. Muth, G.L. Thompson, P.R. Winters (Eds.), Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ, 1963.
37. B.A. Norman, J.C. Bean, Random keys genetic algorithm for job-shop scheduling, Engineering Design and Automation 3 (2) (1997) 145-156.
38. E. Nowicki, C. Smutnicki, A fast tabu search algorithm for the job shop problem, Management Science 42 (1996) 797-813.
39. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall International Series in Industrial and Systems Engineering, Prentice Hall, Englewood Cliffs, NJ, 1995.
40. F. Romeo, A. Sangiovanni-Vincentelli, A theoretical framework for simulated annealing, Algorithmica 6 (1991) 302-345.
41. B. Roy, B. Sussmann, Les problèmes d'Ordonnancement avec Constraints Disjonctives. Note DS No.9 bis. SEMA, 1964.
42. N.M. Sadeh, M.S. Fox, Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem, Artificial Intelligence 861 (1996) 1-41.
43. N.M. Sadeh, Y. Nakakuki, Focused simulated annealing search: An application to job shop scheduling, Annals of Operations Research 63 (1996) 77-103.
44. G. Sorkin, Efficient simulated annealing on fractal energy landscapes, Algorithmica 6 (1991) 367-418.
45. R.H. Storer, S.D. Wu, R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Management Science 38 (1992) 1495-1509.
46. J.D. Ullman, NP-complete scheduling problems, Journal of Computer and System Science 10 (3) (1975) 384-393.
47. R.J.M. Vaessens, E.H.L. Aarts, J.K. Lenstra, Job shop scheduling by local search, INFORMS Journal on Computing 8 (1996) 102-117.
48. P.J.M. Van Laarhoven, E.H.L. Aarts, Simulated Annealing: Theory and Applications, Reidel, Dordrecht, 1988.
49. P.J.M. Van Laarhoven, E.H.L. Aarts, J.K. Lenstra, Job shop scheduling by simulated annealing, Operations Research 401 (1992) 113-125.
50. T. Yamada, R. Nakano, A genetic algorithm applicable to large-scale job shop problems, in: R. Manner, B. Manderick (Eds.), Parallel Problem Solving from Nature 2, North-Holland, Amsterdam, 1992, 281-290.
51. D. Zuckerman, On unapproximable versions of NP-complete problems, SIAM Journal on Computing 25 (6) (1996) 1293-1304.