The odo project: Toward a unified basis for constraint-directed scheduling

Journal of Scheduling

Volumn 1, Issue 2, 1998, Pages 89-125

  Christopher Beck, J ^a   Davenport, Andrew J ^a   Davis, Eugene D ^b   Fox, Mark S ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b PeopleSoft Inc   (United States)

Author keywords

Backtracking; Constraints; Heuristics; Propagators; Scheduling; Search; Texture measurements

Indexed keywords

EID: 0343277802     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1099-1425(199808)1:2<89::aid-jos9>3.0.co;2-h     Document Type: Article

References (91)

1. M. Fox, 'Observations on the role of constraints in problem solving', in Proc. of the 6th Canadian Conf. on Artificial Intelligence, 1986.
2. C. Le Pape and P. Baptiste, 'An experimental comparison of constraint-based algorithms for the preemptive job shop scheduling problem', in CP97 Workshop on Industrial Constraint-Directed Scheduling, 1997.
3. N. Muscettola, 'On the utility of bottleneck reasoning for scheduling', in Proc. AAAI-94, 1994, pp. 1105-1110.
4. J. C. Beck, A. J. Davenport and M. S. Fox, 'Five pitfalls of empirical scheduling research', in G. Smolka, (ed.), Proc. 3rd International Conf. on Principles and Practice of Constraint Programming (CPP7), Springer, Berlin, 1997, pp. 390-404.
5. Y. Caseau and F. Laburthe, 'Cumulative scheduling with task intervals', in Proc. Joint Int. Conf. and Symp on Logic Programming, MIT Press, Cambridge, MA, 1996.
6. C. Le Pape and P. Baptiste, 'Constraint propagation techniques for disjunctive scheduling: the preemptive case', in Proc. ECAI-96, 1996.
7. D. Neiman, D. Hildum, V. Lesser and T. Sandholm 'Exploiting meta-level information in a distributed scheduling system', in Proc. 12th National Conf. on Artificial Intelligence, Seattle, WA, 1994, pp. 394-400.
8. W. P. M. Nuijten, 'Time and resource constrained scheduling: a constraint satisfaction approach', Ph.D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1994.
9. V. Saks, 'Distribution planner overview', Technical Report, Carnegie Group, Pittsburgh, PA, 15222, 1992.
10. M. S. Fox, 'Constraint-directed search: a case study of job-shop scheduling', Ph.D. Thesis, Carnegie Mellon University, Intelligent Systems Laboratory, The Robotics Institute, Pittsburgh, PA, 1983. CMU-RI-TR-85-7.
11. A. K. Mackworth, 'Consistency in networks of relations', Artificial Intelligence, 8, 99-118 (1977).
12. E. P. K. Tsang, Foundations of Constraint Satisfawction, Academic Press, New York, 1993.
13. R. Dechter, A. Dechter and J. Pearl, 'Optimization in constraint networks', in R. Oliver and J. Smith (eds.), Influence Diagrams, Belief Nets, and Decision Analysis, Wiley, Chicester, England, 1990.
14. S. Minton, M. Johnston, A. Philips and P. Laird, 'Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems', Artificial Intelligence, 58, 161-205 (1992).
15. D. Navinchandra and D. H. Marks, 'Design exploration through constraint relaxation', in Expert Systems in Computer-Aided Design, Elsevier, Amsterdam, 1987.
16. D. Navinchandra, Exploration and Innovation in Design, Springer, New York, 1991.
17. V. Kumar, 'Algorithms for constraint satisfaction problems: A survey', AI Mag., 1992, pp. 32-44.
18. S. F. Smith, P. Ow, D. Matthys and J. Potvin, 'OPIS: An opportunistic factory scheduling system', in Proc. Int. Symp. for Computer Scientists, 1989.
19. M. Zweben, E. Davis, B. Daun and M. Deale, 'Informedness vs. computational cost of heuristics in iterative repair scheduling', in Proc. IJCAI-93, 1993, pp. 1416-1422.
20. M. Zweben, B. Daun, E. Davis and M. Deale, 'Scheduling and rescheduling with iterative repair', in M. Zweben and M. Fox (eds.), Intelligent Scheduling, Chap. 8, Morgan Kaufmann Publishers, San Francisco, 1994, pp. 241-256.
21. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guid to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
22. M. S. Fox, 'Constraint-guided scheduling - a short history of research at CMU', Comput. Ind., 14, 79-88 (1990).
23. J. Blazewicz, W. Domschke and E. Pesch, 'The job shop scheduling problem: Conventional and new solution techniques', Eur. J. Oper. Res., 93(1), 1-33 (1996).
24. D. Applegate and W. Cook, 'A computational study of the job-shop scheduling problem', ORSA J. Comput., 3, 149-156 (1990).
25. N. Sadeh, 'Lookahead techniques for micro-opportunistic job-shop scheduling', Ph.D. Thesis, Carnegie-Mellon Univeristy, 1991, CMU-CS-91-102.
26. C. Le Pape, 'Constraint-based programming for scheduling: An historical perspective', in Working Papers of the Operations Research Seminar on Constraint Handling Techniques, 1994.
27. J. Carlier and E. Pinson, 'An algorithm for solving the job-shop problem', Management Sci., 35(2), 164-176 (1989).
28. J. Erschler, F. Roubellat and J. P. Vernhes, 'Finding some essential characteristics of the feasible solutions for a scheduling problem', Oper. Res., 24, 772-782 (1976).
29. J. Erschler, F. Roubellat and J. P. Vernhes, 'Characteristing the set of feasible sequences for n jobs to be carried out on a single machine', Euro. J Oper. Res., 4, 189-194 (1980).
30. N. Sadeh and M. Fox, 'Focus of attention in an activity-based schedule', in Proc NASA Conf. on Space Telerobotics, 1989.
31. K. Sycara, S. Roth, N. Sadeh and M. Fox, 'Distributed constrained heuristic search', IEEE Trans. Systems, Man, Cybernet., SMC-21(6), 1446-1461 (1991).
32. A. Collinot and C. Le Pape, 'Controlling constraint propagation', in Proc. 10th Int. Joint Conf. on Artificial Intelligence, 1987.
33. P. Burke and P. Prosser, 'The distributed asynchronous scheduler', in M. Zweben and M. Fox (eds.), Intelligent Scheduling, Chap. 11, Morgan Kaufmann Publishers, San Francisco, 1994, pp. 309-339.
34. P. Van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA, 1989.
35. Y. Caseau and F. Laburthe, 'Improving branch and bound for jobshop scheduling with constraint propagation', in Proc. 8th Franco-Japanese Conference CCS'95, 1995.
36. C. Le Pape, 'Using a constraint-based scheduling library to solve a specific scheduling problem', in Proc. AAAI-SIGMAN Workshop on Artificial Intelligence Approaches to Modelling and Scheduling Manufacturing Processes, 1994.
37. K. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
38. J. Little, K. Murty, D. Sweeney and C. Karel, 'An algorithm for the traveling saleman problem', Oper. Res., 11(6), 972-989 (1963).
39. F. Glover, 'Tabu search part I', Oper. Res. Soc. Am. (ORSA) J. Comput., 1(3), 109-206 (1989).
40. F. Glover, 'Tabu search part II', Oper. Res. Sco. Am. (ORSA) J. Comput., 2(1), 4-32 (1990).
41. E. Nowicki and C. Smutnicki, 'A fast taboo search algorithm for the job shop problem', Management Sci., 42(6), 797-813 (1996).
42. U. Dorndorf and E. Pesche, 'Evolution based learning in a job shop scheduling environment', Comput. Oper. Res., 22(1), 25-40 (1995).
43. P. Laarhoven, E. Aarts and J. Lenstra, 'Job shop scheduling by simulated annealing', Oper. Res., 40(1), 113-125 (1992).
44. E. D. Davis, 'ODO: a constraint-based scheduler founded on a unified problem solving model', Master's Thesis, Enterprise Integration Laboratory, Department of Industrial Engineering, University of Toronto, 4 Taddle Creek Road, Toronto, Ontario M5S 3G9, Canada, 1994.
45. E. D. Davis and M. S. Fox, 'ODO: a constraint-base scheduling shell', in Proc. Workshop on Production Planning, Scheduling and Control, IJCAI-93, 1993.
46. J. F. Allen, 'Maintaining knowledge about temporal intervals', Commun. ACM, 26(11), 832-843 (1983).
47. C. Le Pape, 'Implementation of resource constraints in ILOG Schedule: A library for the development of constraint-based scheduling systems', Intelligent Systems Engng., 3(2), 55-66 (1994).
48. Y. Caseau and F. Laburthe, 'Improved CLP scheduling with task intervals', in Proc. 11th Int. Conf. on Logic Programming, MIT Press, Cambridge, MA, 1994.
49. S. F. Smith and C. C. Cheng, 'Slack-based heuristics for constraint satisfaction scheduling', in Proc. AAAI-93, 1993, pp. 139-144.
50. C. C. Cheng and S. F. Smith, 'Applying constraint satisfaction techniques to job shop scheduling', Ann. Oper. Res., Special Volume on Scheduling: Theory and Practice, Vol. 1, 1996, forthcoming.
51. B. Selman, H. Levesque and D. G. Mitchell, 'A new method for solving hard satisfiability problems', in Proc. AAAI-92, AAAI Press/MIT Press, Cambridge, MA, 1992, pp. 440-446.
52. B. DeBacker, V. Furnon, P. Kilby, P. Prosser and P. Shaw, 'Local search in constraint programming: application to the vehicle routing problem', in CP97 Workshop on Industrial Constraint-Directed Scheduling, 1997.
53. R. J. M. Vaessens, E. H. L. Aarts and J. K. Lenstra, 'Job shop scheduling by local search', Technical Report COSOR Memorandum 94-05, Eindhoven University of Technology, 1994. Inform. J. Comput., submitted for publications.
54. D. Clements, J. Crawford, D. Joslin, G. Nemhauser, M. Puttlitz and M. Savelsbergh, 'Heuristic optimization: A hybrid AI/OR approach', in Proc. CP97 Workshop on Constraint-Directed Scheduling, November 1997.
55. M. S. Fox, N. Sadeh and C. Baykan, 'Constrained heuristic search', in Proc. IJCAI-89, 1989, pp. 309-316.
56. N. Muscettola, 'Scheduling by iterative partition of bottleneck conflicts', Technical Report CMU-RI-TR-92-05, The Robotics Institute, Carnegie Mellon University, 1992.
57. E. C. Freuder, 'Synthesizing constraining expressions', Commun. Assoc. Comput. Mach., 21(11), 958-966 (1978).
58. E. C. Freuder, 'A sufficient condition for backtrack-free search', J. Assoc. Comput. Mach., 21(1), 24-32 (1982).
59. O. Lhomme, 'Consistency techniques for numeric CSPs', in Proc. IJCAI-93, Vol. 1, 1993, 232-238.
60. J. Carlier and E. Pinson, 'Adjustment of heads and tails for the job-shop problem', Eur. J Oper. Res., 78, 146-161 (1994).
61. P. Martin and D. Shmoys, 'A new approach to computing optimal schedules for the job shop scheduling problem', in Proc. 5th Conf. on Integer Programming and Combinatorial Optimization, 1996.
62. M. Ginsberg, 'Dynamic backtracking', J. Artificial Intelligence Res., 1, 25-46 (1993).
63. J. Gaschnig, 'Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisficing assignment problems', in Proc. 2nd Nat. Conf. of the Canadian Society for Computational Studies of Intelligence, 1978.
64. P. Prosser, 'Hybrid algorithms for the constraint satisfaction problem', Computational Intelligence, 9(3), 268-299 (1993).
65. R. Dechter, 'Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition', Artificial Intelligence, 41, 273-312 (1990).
66. W. D. Harvey, 'Nonsystematic backtracking search', Ph.D. Thesis, Department of Computer Science, Stanford University, 1995.
67. W. D. Harvey and M. L. Ginsberg, 'Limited discrepancy search', in Proc. IJACI-95, 1995, pp. 607-613.
68. R. Korf, 'Improved limited discrepancy search', in Proc. AAAI-96, 1996.
69. T. Walsh, 'Depth-bounded discrepancy search', in Proc. IJCAI-97, 1997.
70. W. Havens, 'Nogood caching for multiagent backtrack search', in Proc. AAAI-97 Constraints and Agents Workshop, Providence, RI, 1997.
71. N. Sadeh, K. Sycara and Y. Xiong, 'Backtracking techniques for the job shop scheduling constraint satisfaction', Artificial Intelligence, 76, 455-480 (1995).
72. N. Sadeh, 'Micro-opportunistic scheduling', in M. Zweben and M. Fox (eds.), Intelligent Scheduling, Chap. 4, Morgan Kaufmann Publishers, San Francisco, 1994, pp. 99-138.
73. N. Sadeh and M. S. Fox, 'Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem', Artificial Intelligence J., 86(1), (1996).
74. W. P. M. Nuijten, E. H. L. Aarts, D. A. A. van Arp Taalman Kip and K. M. van Hee, 'Randomized constraint satisfaction for job shop scheduling', in Proc. IJCAI'93 Workshop on Knowledge-Based Production, Scheduling and Control, 1993, pp. 251-262.
75. S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, 'Optimization by simulated annealing', Science, 220, 671-680 (1983).
76. M. D. Johnston and G. Miller, 'SPIKE: Intelligent scheduling of Hubble space telescope observations', in M. Zweben and M. Fox (eds.), Intelligent Scheduling, Chap. 14, Morgan Kaufmann Publishers, San Francisco, 1994, pp. 391-422.
77. P. Baptiste, C. Le Pape and W. Nuijten, 'Constraint-based optimization and approximation for job-shop scheduling', in Proc. AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI-95, 1995.
78. J. E. Beasley, 'OR-library: distributing test problems by electronic mail', Journal of the Operational Research Society, 41(11), 1069-1072 (1990). Also available by ftp from ftp://graph.ms.ic.ac.uk/pub/paper.txt.
79. J. C. Beck, A. J. Davenport, E. M. Sitarski and M. S. Fox, 'Texture-based heuristics for scheduling revisited', in Proc. AAAI-97, AAAI Press, Menlo Park, California, 1997.
80. J. C. Beck, A. J. Davenport, E. M. Sitarski and M. S. Fox, 'Beyond contention: extending texture-based scheduling heuristics', in Proc. AAAI-97, AAAI Press, Menlo Park, California, 1997.
81. W. Y. Chiang and M. S. Fox, 'Protection against uncertainty in a deterministic schedule', in Proc. Int. Conf. on Expert Systems for Production and Operations Management, 1990.
82. V. J. Leon, S. D. Wu and R. H. Storer, 'Robustness measures and robust scheduling for job shop', IIE Trans., 26(5), 32-43 (1994).
83. H. Gao, 'Building robust schedules using temporal protection - an empirical study of constraint based scheduling under machine failure uncertainty', Master's Thesis, Department of Industrial Engineering, University of Toronto, 1995.
84. G. Laporte, 'The vehicle routing problem: an overview of exact and approximate algorithms', Eur. J. Oper. Res., 59, 345-358 (1992).
85. P. Peasant, M. Gendreau and J. Rousseau, 'GENIUS-CP: A generic single-vehicle routing algorithm', in G. Smolka (ed.), Proc. 3rd Int. Conf. on Principles and Practice of Constraint Programming (CP97), Springer, Berlin, 1997.
86. J. C. Beck, 'Constraint-directed techniques for real-world scheduling', Ph.D. Thesis, University of Toronto, 1998, Forthcoming.
87. P. Ow and T. Morton, 'The single machine early/tardy problem', Management Sci., 35(2), 177-191 (1989).
88. T. Morton, S. Lawrence, Rajagopolan and S. Kerre, 'SCHED-STAR: a price-based shop scheduling module', J. Manuf. Oper. Management, 1(2), 131-181 (1988).
89. K. Baker and G. Scudder, 'Sequencing with earliness and tardiness penalties: A review', Oper. Res., 38(1), 22-36 (1990).
90. B. Faaland and T. Schmit, 'Cost-based scheduling of workers and equipment in a fabrication and assembly shop', Oper. Res., 41(2), 253-268 (1993).
91. J. N. Hooker, 'Testing heuristics: we have it all wrong', J. Heuristics, 1, 33-42 (1996).