The job shop scheduling problem: Conventional and new solution techniques

European Journal of Operational Research

Volumn 93, Issue 1, 1996, Pages 1-33

  Błazewicz, Jacek ^a   Domschke, Wolfgang ^b   Pesch, Erwin ^c  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; MACHINERY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION; SET THEORY;

APPROXIMATION ALGORITHMS; BRANCHING STRATEGY; JOB SHOP SCHEDULING; LOCAL SEARCH HEURISTICS; NEIGHBOURHOOD STRUCTURE;

SCHEDULING;

EID: 0030212629     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00362-2     Document Type: Article

References (224)

1. Aarts, E.H.L., and Korst, J.H.M. (1989), Simulated Annealing and Boltzmann Machines, Wiley, Chichester.
2. Aarts, E.H.L., van Laarhoven, P.J.M., Lenstra, J.K., and Ulder, N.L.J. (1994), "A computational study of local search shop scheduling," ORSA Journal on Computing 6, 118-125.
3. Adams, J., Balas, E., and Zawack, D. (1988), "The shifting bottleneck procedure for job shop scheduling", Management Science 34, 391-401.
4. Aggoun, A., and Beldiceanu, N. (1993), "Extending CHIP in order to solve complex scheduling and placement problems", Mathematical and Computer Modelling 17, 57-73.
5. Akers, S.B. (1956), "A graphical approach to production scheduling problems", Operations Research 4, 244-245.
6. Anderson, E.J., Glass, C.A., and Potts, C.N. (1995), "Local search in combinatorial optimization: Applications in machine scheduling", Research Report No. OR56, University of Southampton.
7. Applegate, D., and Cook, W. (1991), "A computational study of the job-shop scheduling problem", ORSA Journal on Computing 3, 149-156.
8. Ashour, S. (1972), Sequencing Theory, Springer, Berlin.
9. Ashour, S., and Hiremath, S.R. (1973), "A branch-and-bound approach to the job-shop scheduling problem", International Journal of Production Research 11, 47-58.
10. Ashour, S., Moore, T.E., and Chiu, K.-Y. (1974), "An implicit enumeration algorithm for the nonpreemptive shop scheduling problem", AIIE Transactions 6, 62-72.
11. Baker, K.R. (1974), Introduction to Sequencing and Scheduling, Wiley, New York.
12. Baker, K.R. (1975), "A comparative study of flow shop algorithms", Operations Research 23, 62-73.
13. Baker, K.R., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1983), "Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints", Operations Research 31, 381-386.
14. Bakshi, M.S., and Arora, S.R. (1969), "The sequencing problem", Management Science 16, B247-B263.
15. Balas, E. (1969), "Machine sequencing via disjunctive graphs: An implicit enumeration algorithm", Operations Research 17, 941-957.
16. Balas, E. (1985), "On the facial structure of scheduling polyhedra", Mathematical Programming Study 24, 179-218.
17. Balas, E., Lenstra, J.K., and Vazacopoulos, A. (1995), "One machine scheduling with delayed precedence constraints," Management Science 41, 94-109.
18. Balas, E., and Vazacopoulos, A. (1995), "Guided local search with shifting bottleneck fo job shop scheduling", Management Science Research Report #MSRR-609.
19. Baptiste, P., and Le Pape, C. (1995), "A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling", Proc. 14th Int. Joint Conference on Artificial Intelligence (IJCAI), Montreal, Canada.
20. Baptise, P., Le Pape, C., and Nuijten, W. (1995a), "Constrained-based optimization and approximation for job-shop scheduling", Proc. AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, 14th Int. Joint Conference on Artificial Intelligence (IJCAI), Montreal, Canada.
21. Baptiste, P., Le Pape, C., and Nuijten, W. (1995b), "Incorporating efficient operations research algorithms in constraint-based scheduling", Proc. 1st Joint Workshop on Artificial Intelligence and Operations Research, Timberline Lodge, OR (to appear).
22. Barker, J.R., and McMahon, G.B. (1985), "Scheduling the general job-shop", Management Science 31, 594-598.
23. Barnes, J.W., and Chambers, J.B. (1994), "Solving the job shop scheduling problem using tabu search," IIE Transactions 27/2.
24. Barnes, J.W., Laguna, M., and Glover, F. (1992), "An overview of tabu search approaches to production scheduling problems", Proc. Symposium Intelligent Scheduling Systems, San Francisco, 30-50.
25. Bertier, P., and Roy, B. (1965), "Trois exemples numeriques d'application de la procedure SEP", Note de travail No. 32 de la Direction Scientifique de la SEMA.
26. Bierwirth, C. (1995), "A generalized permutation approach to job shop scheduling with genetic algorithms," OR Spektrum 17, 87-92.
27. Blackstone, J.H., Phillips, D.T., and Hogg, G.L. (1982), "A state of the art survey of dispatching rules for manufacturing job shop operations", International Journal Production Research 20, 27-45.
28. Błazewicz, J. (1987), "Selected topics in scheduling theory", Annals of Discrete Mathematics 31, 1-60.
29. Błazewicz, J., Dror, M., and Weglarz, J. (1991), "Mathematical programming formulations for machine scheduling: A survey," European Journal of Operational Research 51, 283-300.
30. Błazewicz, J., Ecker, K., Schmidt, G., and Weglarz, J. (1994), Scheduling in Computer and Manufacturing Systems, 2nd edition, Springer, Heidelberg.
31. Bowman, E.H. (1959), "The scheduling sequencing problem", Operations Research 7, 621.
32. Brah, S., Hunsucker, J., and Shah, J. (1991), "Mathematical modeling of scheduling problems", Journal of Information & Optimization Sciences 12, 113-137.
33. Bräsel, H. (1990), "Lateinische Rechtecke und Maschinenbelegung", Dissertation B, Technical University of Magdeburg.
34. Bräsel, H., and Werner, F. (1989), "The job-shop problem-modelling by latin rectangles exact and heuristic solution," Working paper Math 8/89, Technical University of Magdeburg.
35. Brooks, G.H., and White, C.R. (1965), "An algorithm for finding optimal or near-optimal solutions to the production scheduling problem", Journal of Industrial Engineering 16, 34-40.
36. Brucker, P. (1981), Scheduling, Akademische Verlagsgesellschaft, Wiesbaden.
37. Brucker, P. (1988), "An efficient algorithm for the job-shop problem with two jobs", Computing 40, 353-359.
38. Brucker, P. (1994), "A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs", OR Spektrum 16, 5-7.
39. Brucker, P. (1995), Scheduling Algorithms, Springer, Berlin.
40. Brucker, P., Hurink, J., and Werner, F. (1994a), "Improving local search heuristics for some scheduling problems", Working paper, University of Osnabrück.
41. Brucker, P., Hurink, J., and Werner, F. (1994b), "Improving local search heuristics for some scheduling problems, Part II", Working paper, University of Osnabrück.
42. Brucker, P., and Jurisch, B. (1993), "A new lower bound for the job-shop scheduling problem", European Journal of Operational Research 64, 156-167.
43. Brucker, P., Jurisch, B., and Krämer, A. (1992), "The job-shop problem and immediate selection", Working paper, University of Osnabrück.
44. Brucker, P., Jurisch, B., and Sievers, B. (1992), "Job-shop (C codes)", European Journal of Operational Research 57, 132-133.
45. Brucker, P., Jurisch, B. and Sievers, B. (1994), "A branch and bound algorithm for the job-shop scheduling problem," Discrete Applied Mathematics 49, 107-127.
46. Burns, F., and Rooker, J. (1978), "Three-stage flow-shops with recessive second stage", Operations Research 26, 207-208.
47. Campbell, H.G., Dudek, R.A., and Smith, M.L. (1970), "A heuristic algorithm for the n job m machine sequencing problem," Management Science 16, 630-637.
48. Carlier, J. (1982), "The one machine sequencing problem," European Journal of Operational Research 11, 42-47.
49. Carlier, J. (1987), "Scheduling jobs with release dates and tails on identical machines to minimize the makespan", European Journal of Operational Research 29, 298-306.
50. Carlier, J., and Pinson, E. (1989), "An algorithm for solving the job-shop problem," Management Science 35, 164-176.
51. Carlier, J., and Pinson, E. (1990), "A practical use of Jackson's preemptive schedule for solving the job shop problem", Annals of Operations Research 26, 269-287.
52. Carlier, J., and Pinson, E. (1994), "Adjustments of heads and tails for the job-shop problem", European Journal of Operational Research 78, 146-161.
53. Caseau, Y., and Laburthe, F. (1995), "Disjunctive scheduling with task intervals", Working paper, Ecole Normale Supérieure, Paris
54. Caseau, Y., Le Pape, C., and Nuijten, W. (1996), Private communication.
55. Charlton, J.M., and Death, C.C. (1970), "A generalized machine scheduling algorithm", Operations Research Quarterly 21, 127-134.
56. Cho, Y., and Sahni, S. (1981), "Preemptive scheduling of independent jobs with release and due times on open, flow and job shops", Operations Research 29, 511-522.
57. Chrétienne, P., Coffman, Jr., E.G., Lenstra, J.K., and Liu, Z. (1995), Scheduling Theory and its Applications, Wiley, Chichester.
58. Chu, C., Portmann, M.C., and Proth, J.M. (1992), "A splitting-up approach to simplify job-shop scheduling problems", International Journal of Production Research 30, 859-870.
59. Clark, W. (1922), The Gantt Chart: A Working Tool of Management, The Ronald Press, 3rd ed., Pittman, New York.
60. Coffman, E.G. (ed.) (1976), Computer and Job-Shop Scheduling Theory, Wiley, New York.
61. Conway, R.N., Maxwell, W.L., and Miller, L.W. (1967), Theory of Scheduling, Addison-Wesley, Reading, MA.
62. Crama, Y., Kolen, A., and Pesch, E. (1995), "Local search in combinatorial optimization", Lecture Notes in Computer Science 931, 157-174.
63. Crowston, W.B., Glover, F., Thompson, G.L., and Trawick, J.D. (1963), "Probabilistic and parametric learning combinations of local job shop scheduling rules", ONR Research Memorandum No. 117, GSIA, Carnegie-Mellon University, Pittsburg, PA.
64. Dannenbring, D.G. (1977), "An evaluation of flow shop scheduling heuristics", Management Science 23, 1174-1182.
65. Dauzere-Peres, S., and Lasserre, J.-B. (1993), "A modified shifting bottleneck procedure for job-shop scheduling", International Journal of Production Research 31, 923-932.
66. Davis, L. (1985), "Job shop scheduling with genetic algorithms", Proc. International Conf. on Genetic Algorithms and Their Applications (J.J. Grefenstette, ed.), Lawrence Erlbaum Ass., 136-140.
67. Day, J.E., and Hottenstein, M.P. (1970), "Review of sequencing research", Naval Research Logistics Quarterly 17, 11-39.
68. Dechter, R., and Pearl, J. (1988), "Network-based heuristics for constraint satisfaction problems," Artificial Intelligence 34, 1-38.
69. Della Croce, F., Tadei, R., and Volta, G. (1995), "A genetic algorithm for the job shop problem", Computers & Operations Research 22, 15-24.
70. Dell'Amico, M. (1993), "Shop problems with two machines and time lags," Working paper, Politecnico di Milano.
71. Dell'Amico, M., and Trubian, M. (1993), "Applying tabu-search to the job shop scheduling problem", Annals of Operations Research 41, 231-252.
72. Domschke, W., Scholl, A., and Voß, S.(1993), Produktionsplanung, Springer, Berlin.
73. Dorndorf, U., and Pesch, E. (1993a), "Combining genetic and local search for solving the job shop scheduling problem," Symposium on Applied Mathematical Programming and Modeling APMOD93 (I. Maros, ed.), Akaprint, Budapest, 142-149.
74. Dorndorf, U., and Pesch, E. (1993b), "Genetic algorithms for job shop scheduling", in: K.-W. Hansmann et al., (eds.), Operations Research Proc. 1992, Springer, Berlin, 243-250.
75. Dorndorf, U., and Pesch, E. (1994a), "Variable depth search and embedded schedule neighbourhoods for job shop scheduling", 4th International Workshop on Project Management and Scheduling, 232-235.
76. Dorndorf, U., and Pesch, E. (1994b), "Fast clustering algorithms", ORSA Journal on Computing 6, 141-153.
77. Dorndorf, U., and Pesch, E. (1995), "Evolution based learning in a job shop scheduling environment", Computers & Operations Research 22, 25-40.
78. Dudek, R.A., Panwalkar, S.S., and Smith, M.L. (1992), "The lessons of flowshop scheduling research", Operations Research 40, 7-13.
79. Ecker, K. (1977), Organisation von parallelen Prozessen, BI-Wissenschaftsverlag, Mannheim.
80. Elmaghraby, S.E. (1968), "The machine sequencing problem-Review and extensions", Naval Research Logistics Quarterly 15, 205-232.
81. Elmaghraby, S.E., and Elshafei, A.N. (1976), "Branch-and-bound revised: A survey of basic concepts and their applications in scheduling", in: W.H. Marlow (ed.), Modern Trends in Logistics Research, MIT Press, Cambridge, MA.
82. Fisher, M.L. (1973), "Optimal solution of scheduling problems using Lagrange multipliers: Part I", Operations Research 21, 1114-1127.
83. Fisher, M.L., Lageweg, B.J., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1983), "Surrogate duality relaxation for job shop scheduling", Discrete Applied Mathematics 5, 65-75.
84. Fisher, H., and Thompson, G.L. (1963), "Probabilistic learning combinations of local job-shop scheduling rules", in: J.F. Muth and G.L. Thompson (eds.), Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ.
85. Florian, M., Trépant, P., and McMahon, G. (1971), "An implicit enumeration algorithm for the machine sequencing problem", Management Science 17, B782-B792.
86. Fox, M.S. (1987), Constraint-directed search: A case study of job shop scheduling, Pitman, London.
87. Fox, M.S., and Smith, S.F. (1984), "ISIS-A knowledge based system for factory scheduling," Expert Systems 1, 25-49.
88. French, S. (1982), Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Wiley, New York.
89. Gantt, H.L. (1919), "Efficiency and democracy", Transactions of the American Society of Mechanical Engineers. 40, 799-808.
90. Garey, M.R., Johnson, D.S., and Sethi, R. (1976), "The complexity of flowshop and jobshop scheduling", Mathematics of Operations Research 1, 117-129.
91. Gere, W.S. (1966), "Heuristics in job-shop scheduling", Management Science 13, 167-190.
92. Giffler, B., and Thompson, G.L. (1960), "Algorithms for solving production scheduling problems", Operations Research 8, 487-503.
93. Giffler, B., Thompson, G.L., and van Ness, V. (1963), "Numerical experience with the linear and Monte Carlo algorithms for solving production scheduling problems", in: J.F. Muth and G.L. Thompson (eds.), Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ.
94. Glass, C.A., Potts, C.N., and Shade, P. (1992), "Genetic algorithms and neighbourhood search for scheduling unrelated parallel machines", Working paper No. OR47, University of Southampton.
95. Glover, F. (1989), "Tabu search - Part I", ORSA Journal on Computing 1, 190-206.
96. Glover, F. (1990a), "Tabu search - Part II", ORSA Journal on Computing 2, 4-32.
97. Glover, F. (1990b), "Tabu search: A tutorial", Interfaces 20, 74-94.
98. Glover, F. (1991), "Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem", Working paper, University of Colorado, Boulder.
99. Glover, F. (1992), "Ejection chains, reference structures and alternating path methods for the traveling salesman problem," Working paper, University of Colorado, Boulder.
100. Glover, F., and Pesch, E. (1995), "TSP ejection chains", Discrete Applied Mathematics, to appear.
101. Goldberg, D.E. (1989), Genetic Algorithms in Search. Optimization and Machine Learning, Addison-Wesley, Reading, MA.
102. Gonzalez, T., and Sahni, S. (1978), "Flowshop and jobshop schedules: Complexity and approximation", Operations Research 20, 36-52.
103. Grabowski, J., Nowicki, E., and Zdrzalka, S.S. (1986), "A block approach for single machine scheduling with release dates and due dates", European Journal of Operational Research 26, 278-285.
104. Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1978), "Optimization and approximation in deterministic sequencing and scheduling: A survey", in: J.K. Lenstra, A.H.G. Rinnooy Kan, and P. van Emde Boas (eds.), Interfaces between Computer Science and Operations Research, Mathematical Centre Tracts 99, Amsterdam, 169-231.
105. Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1979), "Optimization and approximation in deterministic sequencing and scheduling theory: A survey", Annals of Discrete Mathematics 5, 287-326.
106. Green, G.I., and Appel, L.B. (1981), "An empirical analysis of job shop dispatch rule selection," Journal of Operations Management 1, 197-203.
107. Greenberg, H.H. (1968), "A branch and bound solution to the general scheduling problem", Operations Research 16, 353-361.
108. Gupta, J.N.D. and Reddi, S.S. (1978), "Improved dominance conditions for the three-machine flowshop scheduling problem," Operations Research 26, 200-203.
109. Han, C.C., and Lee, C.H. (1988), "Comments on Mohr and Henderson path consistency algorithm," Artificial Intelligence 36, 125-130.
110. Haupt, R. (1989), "A survey of priority-rule based scheduling", OR Spektrum 11, 3-16.
111. Hax, A.C., and Candea, D. (1984), Production and Inventory Management, Prentice-Hall, Englewood Cliffs, NJ.
112. Hefetz, N., and Adiri, I. (1982), "An efficient optimal algorithm for the two-machines unit-time job-shop schedule length problem", Mathematics of Operations Research 7, 354-360.
113. van Hentenryck, P., Deville, Y., and Teng, C.-M. (1992), "A generic arc-consistency algorithm and its specializations", Artificial Intelligence 57, 291-321.
114. Hilliard, M.R., and Liepins, G.E. (1988), "Machine learning applications to job shop scheduling", Proceedings Workshop on Production Planning and Scheduling, AAAI-SIGMAN, St. Paul, MN.
115. Ho, J.C., and Chang, Y-L. (1991), "A new heuristic for the n-job, M-machine flow-shop problem", European Journal of Operational Research 52, 194-202.
116. Hoitomt, D.J., Luh, P.B., and Pattipati, K.R. (1993), "A practical approach to job-shop scheduling problems", IEEE Transactions on Robotics and Automation 9, 1-13.
117. Holland, J.H. (1975), Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, MI.
118. Hübscher, R., and Glover, F. (1992), "Applying tabu search with influential diversification to multiprocessor scheduling", Working paper, University of Colorado, Boulder.
119. Hundal, T.S., and Rajgopal, J. (1988), "An extension of Palmer's heuristic for the flow-shop scheduling problem", International Journal of Production Research 26, 1119-1124.
120. Husbands, P., Mill, F., and Warrington, S. (1991), "Genetic algorithms, production plan optimisation and scheduling", Lecture Notes in Computer Science 496, 80-84.
121. Ignall, E., and Schrage, L. (1965), "Application of the branch-and bound technique to some flow-shop scheduling problem", Operations Research 13, 400-412.
122. Jackson, J.R. (1956), "An extension of Johnson's results on job lot scheduling," Naval Research Logistics Quarterly 3, 201-203.
123. Johnson, D.S. (1983), "The NP-completeness column: An ongoing guide", Journal of Algorithms 4, 189-203.
124. Johnson, D.S., Papadimitriou, C.H., and Yannakakis, M. (1988), "How easy is local search?", Journal of Computer System Science 37, 79-100
125. Johnson, L.A., and Montgomery, D.C. (1974) Operations Research in Production Planning, Scheduling and Inventory Control, Wiley, New York.
126. Johnson, S.M. (1954), "Optimal two- and three-stage production schedules with setup times included", Naval Research Logistics Quarterly 1, 61-68.
127. Kawaguchi, T., and Kyan, S. (1988), "Deterministic scheduling in computer systems: A survey," Journal of the Operational Research Society Japan 31, 190-217.
128. Kolen, A., and Pesch, E. (1994), "Genetic local search in combinatorial optimization," Discrete Applied Mathematics 48, 273-284.
129. Kubiak, W., Sethi, S., and Srishkandarajah, C. (1994), "An efficient algorithm for a job shop problem", Mathematics of Industrial Systems, to appear.
130. Kusiak, A., and Chen, M. (1988), "Expert systems for planning and scheduling manufacturing systems", European Journal of Operational Research 34, 113-130.
131. van Laarhoven, P.J.M., and Aarts, E.H.L. (1987), Simulated Annealing: Theory and Applications, Reidel, Dordrecht, Netherlands.
132. van Laarhoven, P.J.M., Aarts, E.H.L., and Lenstra, J.K. (1992), "Job shop scheduling by simulated annealing", Operations Research 40, 113-125.
133. Lageweg, B., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1982), "Computer aided complexity classification of combinatorial problems", Communications of the ACM 25, 817-822.
134. Lageweg, B., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1977), "Job-shop scheduling by implicit enumeration", Management Science 24, 441-450.
135. Lageweg, B., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1978), "A general bounding scheme for the permutation flow-shop problem", Operations Research 26, 53-67.
136. Larson, R.E., Dessouky, M.I., and Devor, R.E. (1985), "A forward-backward procedure for the single machine problem to minimize maximum lateness", IIE Transactions 17, 252-260.
137. Lawler, E.L. (1982), "Recent results in the theory of machine scheduling," in: A. Bachern, M. Grötschel, and B. Körte (eds.), Mathematical Programming: The State of the Art, Springer, Berlin.
138. Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1982), "Recent developments in deterministic sequencing and scheduling: A survey", in: M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan (eds.), Deterministic and Stochastic Scheduling, Proc. of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems, Reidel, Dordrecht, 35-73.
139. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. (1993), "Sequencing and scheduling: algorithms and complexity", in: S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin (eds.), Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory Elsevier, Amsterdam.
140. Lenstra, J.K. (1977), Sequencing by Enumerative Methods, Mathematical Center Tract 69, Mathematisch Centrum, Amsterdam.
141. Lenstra, J.K., and Rinnooy Kan, A.H.G. (1979), "Computational complexity of discrete optimization problems", Annals of Discrete Mathematics 4, 121-140.
142. Lenstra, J.K., Rinnooy Kan, R.H.G., and Brucker, P. (1977), "Complexity of machine scheduling problems", Annals of Discrete Mathematics 4, 121-140.
143. Lourenço, H.R. (1993), "A computational study of the job-shop and flow shop scheduling problem", Dissertation, Cornell University, Ithaca.
144. Lourenço, H.R. (1995), "Job-shop scheduling: Computational study of local search and large-step optimization methods," European Journal of Operational Research 83, 347-364.
145. Mackworth, A.K. (1977), "Consistency in networks of relations," Artificial Intelligence 8, 99-118.
146. Manne, A.S. (1960), "On the job shop scheduling problem", Operations Research 8, 219-223.
147. Martin, P., and Shmoys, D. (1995), "A new approach to computing optimal schedules for the job shop scheduling problem", Extended Abstract, Cornell University, Ithaca.
148. Mattfeld, D.C. (1995), "Evolutionary search and the job shop", Dissertation, University of Bremen.
149. Matsuo, H., Suh, C.J., and Sullivan, R.S. (1988), "A controlled search simulated annealing method for the general jobshop scheduling problem", Working paper 03-04-88, University of Texas at Austin.
150. McMahon, G.B. (1969), "Optimal production schedules for flow shops", Canadian Operations Research Society Journal 7, 141-151.
151. McMahon, G.B., and Florian, M. (1975), "On scheduling with ready times and due dates to minimize maximum lateness", Operations Research 23, 475-482.
152. Mellor, P. (1966), "A review of job shop scheduling", Operations Research Quarterly 17, 161-171.
153. Meseguer, P. (1989), "Constraint satisfaction problems: An overview", AICOM 2, 3-17.
154. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. (1953), "Equation of state calculations by fast computing machines", Journal Chemical Physics 21, 1087-1092.
155. Meyer, W. (1992), "Geometrische Methoden zur Lösung von Job-Shop Problemen und deren Verallgemeinerungen", Dissertation, University of Osnabrück.
156. Michalewicz, Z. (1992), "Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin.
157. Minton, S., Johnston, M.D., Philips, A.B., and Laird, P. (1992), "Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems", Artificial Intelligence 58, 161-205.
158. Mohr, R., and Henderson, T.C. (1986), "Arc and path consistency revisited", Artificial Intelligence 28, 225-233.
159. Monma, C.L., and Rinnooy Kan, A.H.G. (1983), " A concise survey of efficiently solvable special cases of the permutation flow shop problem", RAIRO 17, 105-119.
160. Montanari, U. (1974), "Networks of constraints: Fundamental properties and applications to picture processing", Informations Sciences 7, 95-132.
161. Moore, J.M., and Wilson, R.C. (1967), "A review of simulation research in job shop scheduling", Production and Inventory Management 8, 1-10.
162. Muth, J.F., and Thompson, G.L. (eds.) (1963), Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ.
163. Nakano, R., and Yamada, T. (1991), "Conventional genetic algorithm for job shop problems", in: R.K. Belew and L.B. Booker (eds.), Proc. 4th. International Conf. on Genetic Algorithms, Morgan Kaufmann, 474-479.
164. Nawaz, M., Enscore, E.E., and Ham, I. (1983), "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem", Omega 11, 91-95.
165. Nowicki, E., and Smutnicki, C. (1993), "A fast taboo search algorithm for the job shop problem", Management Science, to appear.
166. Nowicki, E., and Smutnicki, C. (1994), "A fast tabu search algorithm for the flow shop problem", Working paper, Technical University Wrocław.
167. Nowicki, E., and Zdrzalka, S. (1986), "A note on minimizing maximum lateness in a one-machine sequencing problem with release dates", European Journal of Operational Research 23, 266-267.
168. Nuijten, W.P.M. (1994), Time and Resource Constrained Scheduling, Dissertation, Ponsen & Looijen, Wageningen, The Netherlands.
169. Nuijten, W.P.M., and Aarts, E.H.L. (1996), "A computational study of constraint satisfaction for multiple capacitated job shop scheduling", European Journal of Operational Research 90, 269-284.
170. O'Grady, P.J., and Harrison, C. (1985), "A general search sequencing rule for job shop sequencing", International Journal of Production Research 23, 951-973.
171. Osman, I.H., and Potts, C.N. (1989), "Simulated annealing for permutation flow shop scheduling", Omega 17, 551-557.
172. Ow, P.S., and Smith, S.F. (1988), "Viewing scheduling as an opportunistic problem-solving process", Annals of Operations Research 12, 85-108.
173. Palmer, D.S. (1965), "Sequencing jobs through a multi-stage process in the minimum total time-A quick method of obtaining a near optimum", Operational Research Quarterly 16, 101-107.
174. Panwalkar, S.S., and Iskander, W. (1977), "A survey of scheduling rules", Operations Research 25, 45-61.
175. Papadimitriou, C.H., and Steiglitz, K. (1982), Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ.
176. Perregaard, M., and Clausen, J. (1995), "Parallel branch-and-bound methods for the job-shop scheduling problem", Working paper, University of Copenhagen.
177. Pesch, E. (1993), "Machine learning by schedule decomposition", Working paper, University of Limburg, Maastricht.
178. Pesch, E. (1994), Learning in Automated Manufacturing, Physica, Heidelberg.
179. Pesch, E., and Tetzlaff, U. (1995), "Constraint propagation based scheduling of job shops", INFORMS Journal on Computing, to appear.
180. Pinedo, M. (1995), Scheduling Theory, Algorithms and Systems, Prentice Hall, Englewood Cliffs, NJ.
181. Pinson, E. (1988), "Le problème de job-shop", Dissertation, University Paris VI, Paris.
182. Pinson, E. (1992), "The job shop scheduling problem: A concise survey and some recent developments", Working paper, University Catholique de l'Ouest, Angers, France.
183. Pirlot, M. (1992), "General local search heuristics in combinatorial optimization: A tutorial", JORBEL 32, 7-68.
184. Porter, D.B. (1968), "The Gantt chart as applied to production scheduling and control", Naval Research Logistics Quarterly 15, 311-317.
185. Potts, C.N. (1980a), "An adaptive branching rule for the permutation flow-shop problem", European Journal of Operational Research 5, 19-25.
186. Potts, C.N. (1980b), "Analysis of a heuristic for one machine sequencing with release dates and delivery times", Operations Research 28, 1436-1441.
187. Potts, C.N., Shmoys, D.B., and Williamson, D.P. (1991), "Permutation vs. non-permutation flow shop schedules", Operations Research Letters 10, 281-284.
188. Proust, C. (1992), "De l'influence des idées de S.M. Johnson dans la résolution des problèmes dÓdonnancement de type Flowshop", Working paper, University F. Rabelais, Tours, France.
189. Rinnooy Kan, A.H.G. (1976), Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, The Hague.
190. Rock, H. (1984), "The three-machine no-wait flow shop problem is NP-complete", Journal of the ACM 51, 336-345.
191. Rodammer, F.A., and White, K.P. (1988), "A recent review of production scheduling", IEEE Transactions on Systems, Man, and Cybernetics 18, 841-852.
192. Roy, B., and Sussmann, B. (1964), "Les problèmes d'ordonnancement avec contraintes disjonctives", SEMA, Note D.S. No. 9., Paris.
193. Sadeh, N. (1991), "Look-ahead techniques for micro-opportunistic job shop scheduling", Dissertation, Carnegie Mellon University, Pittsburgh, PA.
194. Salvador, M.S. (1978), "Scheduling and sequencing", in: J.J. Moder and S.E. Elmaghraby, (eds.), Handbook of Operations Research: Models and Applications, Van Nostrand Reinhold, New York.
195. Sauer, J. (1995), "Scheduling and meta-scheduling", in: C. Beierle and L. Plümer (eds.), Logic Programming: Formal Methods and Practical Applications, Elsevier, Amsterdam.
196. Smith, S.F., Fox, M.S., and Ow, P.S. (1986), "Constructing and maintaining detailed production plans: Investigations into the development of knowledge-based factory scheduling systems", AI Magazine, 46-61.
197. Sotskov, Y.N. (1991), "The complexity of scheduling problems with two and three jobs", European Journal of Operational Research 53, 326-336.
198. Sotskov, Y.N., and Shaklevich, N.V. (1995), "NP-hardness of shop scheduling problems with three jobs", Discrete Applied Mathematics 59, 237-266.
199. Stafford, E.F. (1988), "On the development of a mixed-integer linear programming model for the flowshop sequencing problem", Journal of the Operational Research Society 39, 1163-1174.
200. Starkweather, T., Whitley, D., Mathias, K., and McDaniel, S. (1992), "Sequence scheduling with genetic algorithms", in: G. Fandel, T. Gulledge, and J. Jones (eds.), New Directions for Operations Research in Manufacturing, Springer, Berlin, 129-148.
201. Storer, R.H., Wu, S.D., and Park, I. (1992), "Genetic algorithms in problem space for sequencing problems", in: G. Fandel, T. Gulledge, and A. Jones (eds.) New Directions for Operations Research in Manufacturing, Proc. of the 2nd Joint US/German Conf., Hagen.
202. Storer, R.H., Wu, S.D. and Vaccari, R. (1991), "Local search in problem and heuristic space for job shop scheduling genetic algorithms", in: G. Fandel, T. Gulledge, and A. Jones (eds.), New Directions for Operations Research in Manufacturing, Proc. of a Joint US/German Conf., Gaithersburg, Maryland.
203. Storer, R.H., Wu, S.D., and Vaccari, R. (1992a), "New search spaces for sequencing problems with application to job shop scheduling", Management Science 38, 1495-1509.
204. Storer, R.H., Wu, S.D., and Vaccari, R. (1992b), "Problem and heuristic space search strategies for job shop scheduling", Working paper, Lehigh University, Bethlehem, PA.
205. Sun, D., Batta, R., and Lin, L. (1995), "Effective job shop scheduling through active chain manipulation", Computers & Operations Research 22, 159-172.
206. Szwarc, W. (1971), "Elemination methods in the m X n sequencing problem", Naval Research Logistics Quarterly 18, 295-305.
207. Szwarc, W. (1973), "Optimal elemination methods in the m X n sequencing problem", Operations Research 21, 1250-1259.
208. Szwarc, W. (1978), "Dominance conditions for the three-machine flow shop problem", Operations Research 26, 203-206.
209. Taillard, E. (1994), "Parallel taboo search technique for the job shop scheduling problem", ORSA Journal on Computing 6, 108-117.
210. Taillard, E. (1990), "Some efficient heuristic methods for the flow shop sequencing problem", European Journal of Operational Research 47, 65-74.
211. Taillard, E. (1993), "Benchmarks for basic scheduling problems", European Journal of Operational Research 64, 278-285.
212. Tanaev, V.S., Gordon, V.S., and Shafransky, Y.M. (1994), Scheduling Theory: Single-Stage Systems, Kluwer Academic Publ., Dordrecht.
213. Tanaev, V.S., Sotskov, Y.N., and Strusevich, V.A. (1994), Scheduling Theory: Multi-Stage Systems, Kluwer Academic Publ., Dordrecht.
214. Thompson, G.L., and Zawack, D.J. (1985/6), "A problem expanding parametric programming method for solving the job shop scheduling problem", Annals of Operations Research 4, 327-342.
215. Turner, S., and Booth, D. (1987), "Comparison of heuristics for flow shop sequencing", Omega 15, 75-78.
216. Ulder, N.L.J., Aarts, E.H.L., Bandelt, H.-J., van Laarhoven, P.J.M., and Pesch, E. (1991), "Genetic local search algorithms for the traveling salesman problem", Lecture Notes in Computer Science 496, 109-116.
217. Vaessens, R.J.M. (1995), "Generalized job shop scheduling: Complexity and local search", Dissertation, University of Technology Eindhoven.
218. Vaessens, R.J.M., Aarts, E.H.L., and Lenstra, J.K. (1995), "Job shop scheduling by local search", Working paper, University of Technology, Eindhoven.
219. van de Velde, S. (1991), "Machine scheduling and Lagrangian relaxation", Dissertation, CWI Amsterdam.
220. Wagner, H.M. (1959), "An integer linear programming model for machine scheduling", Naval Research Logistics Quarterly 6, 131.
221. White, K.P., and Rogers, R.V. (1990), "Job-shop scheduling: Limits of the binary disjunctive formulation", International Journal of Production Research 28, 2187-2200.
222. Widmer, M., and Hertz, A. (1989), "A new heuristic method for the flow shop sequencing problem", European Journal of Operational Research 41, 186-193.
223. Yamada, T., and Nakano, R. (1992), "A genetic algorithm applicable to large-scale job-shop problems", in: R. Männer and B. Manderick (eds.), Parallel Problem Solving from Nature 2, Elsevier, Amsterdam, 281-290.
224. Yannakakis, M. (1990), "The analysis of local search problems and their heuristics", Lecture Notes in Computer Science 415, 298-311.