Applying constraint satisfaction techniques to job shop scheduling

Annals of Operations Research

Volumn 70, Issue , 1997, Pages 327-357

  Cheng, Cheng Chung ^a   Smith, Stephen F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031517380     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018934507395     Document Type: Article

References (42)

1. R.J. Aarts and S.F. Smith, A high performance scheduler for an automated chemistry workstation, in: Proceedings of 1994 European Conference on Artificial Intelligence, Amsterdam, 1994.
2. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science 34(1988)391-401.
3. J.F. Allen, Maintaining knowledge about temporal intervals, Communications of the ACM 11(1983) 832-843.
4. D. Applegate and W. Cook, A computational study of the job-shop scheduling problem, ORSA Journal of Computing 3(1991)149-156.
5. R. Armstrong, L. Lei and S. Gu, A bounding scheme for deriving the minimal cycle time of a single-transporter n-stage process with time-window constraints, European Journal of Operational Research 78(1994)13-140.
6. E. Balas, Machine sequencing via disjunctive graphs: An implicit enumerated algorithm, Operations Research 17(196)941-957.
7. E. Balas, J.K. Lenstra and A. Vazacopoulos, The one machine problem with delayed precedence constraints and its use in job shop scheduling, Technical Report No. MSRR-589(R), Graduate School of Industrial Administration, Carnegie Mellon University, 1993.
8. C.E. Bell, Maintaining project networks in automated artificial intelligence planning, Management Science 35(1989)1192-1214,
9. M.S. Boddy and R.P. Goldman, Empirical results on scheduling and dynamic backtracking, in: Proceedings of the 3rd International Symposium on Artificial Intelligence, Robotics and Automation for Space, Pasadena, CA, October, 1994.
10. P. Brucker, B. Jurisch and B. Sievers, A branch and bound algorithm for the job-shop scheduling problem, Technical Report, Osnabrücker Schriften zur Mathematik, Universität Osnabrück, 1992.
11. J. Carlier and E. Pinson, An algorithm for solving the job-shop problem, Management Science 35(1989)164-176.
12. C. Cheng and S.F. Smith, Generating feasible schedules under complex metric constraints, in: Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle, Washington, 1994.
13. C. Cheng and S.F. Smith, Applying constraint satisfaction techniques to job shop scheduling (the unabridged version), Technical Report CMU-RI-TR-95-03, The Robotics Institute, Carnegie Mellon University, 1995.
14. E.G. Coffman, M.R. Garey and D.S. Johnson, An application of bin-packing to multiprocessor scheduling, SIAM J. Comput. 7(1978)1-17.
15. R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence 49(1991) 61-95.
16. J. Erschler, F. Roubellat and J.P. Vernhes, Finding some essential characteristics of the feasible solutions for a scheduling problem, Operations Research 24(1976)772-782.
17. J. Erschler, F. Roubellat and J.P. Vernhes, Characterizing the set of feasible sequences for n jobs to be carried out on a single machine, European Journal of Operational Research 4(1980)189-194.
18. H. Fisher and G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in: Industrial Scheduling, J.F. Muth and G.L. Thompson, eds., Prentice-Hall, Englewood Cliffs, NJ, 1963.
19. M. Florian, P. Trepant and G.B. McMahon, An implicit enumeration algorithm for the machine sequencing problem, Management Science 17(1971)782-792.
20. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.
21. W.D. Harvey, Search and jobshop scheduling, Technical Report CIRL TR 94-1, Computer Science Department, Stanford University, and Computational Intelligence Research Laboratory, University of Oregon, 1994.
22. N. Hirabayashi, H. Nagasawa and N. Nishiyama, A decomposition scheduling method for operating flexible manufacturing systems, International Journal of Production Research 32(1994)161-178.
23. H. Kautz and P.B. Ladkin, Integrating metric and qualitative temporal reasoning, in: Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, 1991, pp. 241-246.
24. P.B. Ladkin and R.D. Maddux, On binary constraint networks, Technical Report, Kestrel Institute, Palo Alto, CA, 1989.
25. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Technical Report, Report Centre Mathematics and Computer Science, Amsterdam, 1989.
26. S. Lawrence, Resource constraint project scheduling: An experimental investigation of heuristic scheduling techniques, Technical Report, Graduate School of Industrial Administration, Carnegie Mellon University, 1984.
27. I. Meiri, Combining qualitative and quantitative constraints in temporal reasoning, in: Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, 1991, pp. 260-267.
28. S. Minton, M.D. Johnston, A.B. Philips and P. Laird, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58(1992) 161-205.
29. N. Muscettola, Scheduling by iterative partition of bottleneck conflicts, in: Proceedings of the 9th IEEE Conference on Artificial Intelligence Applications, Orlando, FL, 1993.
30. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Technical Report, Technical University of Wroclaw, Institute of Engineering Cybernetics, ul. Janiszewskiego 11/17, 50-372 Wroclaw, Poland, 1994.
31. S.S. Panwalker and W. Iskander, A survey of scheduling rules, Operations Research 25(1977) 45-61.
32. N. Sadeh, Look-ahead techniques for micro-opportunistic job shop scheduling, Technical Report CMU-CS-91-102, School of Computer Science, Carnegie Mellon University, 1991.
33. G.W. Shapiro and H.L.W. Nuttle, Hoist scheduling for a pcb electroplating facility, HE Transac-tions 20(1988)157-167.
34. S.F. Smith and C. Cheng, Slack-based heuristics for constraint satisfaction scheduling, in: Proceedings of the 11th National Conference on Artificial Intelligence, Washington, DC, 1993, pp. 139-144.
35. R.H. Storer, S.D. Wu and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Management Science 38(1992)1495-1509.
36. E. Taillard, Parallel taboo search technique for the jobshop scheduling problem, Technical Report ORWP 89/11, Département de Mathématiques, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland, 1989.
37. E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research 64(1993)278- 285.
38. P.J.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Operations Research 40(1992)113-125.
39. M. Vilain and H. Kautz, Constraint propagation algorithms for temporal reasoning, in: Proceedings of the 4th National Conference on Artificial Intelligence, Philadelphia, PA, 1986, pp. 377-382.
40. Y. Xiong, N. Sadeh and K. Sycara, Intelligent backtracking techniques for job shop scheduling, in: Proceedings of the 3rd International Conference on Principle of Knowledge Representation, Cambridge, MA, 1992.
41. Y. Yih, An algorithm for hoist scheduling problems, International Journal of Productions Research 32(1994)501-516.
42. Y Yih, T. Liang and H. Moskowitz, Robot scheduling in a circuit board production line: A hybrid or/and approach, HE Transactions 25(1993)26-33, 1993.