Heuristics for scheduling with inventory: Dynamic focus via constraint criticality

Journal of Scheduling

Volumn 5, Issue 1, 2002, Pages 43-69

  Beck, J Christopher ^a  

^a IBM   (United States)

Author keywords

Constraints; Heuristic search; Inventory; Problem structure; Scheduling

Indexed keywords

HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; PRODUCTION;

INVENTORY CONSTRAINTS; INVENTORY SCHEDULING;

SCHEDULING;

EID: 0346388719     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.91     Document Type: Article

References (31)

1. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company: New York, 1979.
2. Blazewicz J, Domschke W, Pesch E. The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research 1996; 93(1):1-33.
3. Beck JC. Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling. PhD Thesis, University of Toronto, 1999.
4. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64: 278-285.
5. Carlier J, Pinson E. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research 1994; 78:146-161.
6. Simonis H, Cornelissens T. Modelling producer/consumer constraints. In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP95), Montanari U, Ross F (eds). Springer: Berlin, 1995; 449-462.
7. Aggoun A, Beldiccanu N. Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling 1993; 17(7):57-73.
8. Le Pape C. Using a constraint-based scheduling library to solve a specific scheduling problem. In Proceedings of the AAAI-SIGMAN Workshop on Artificial Intelligence Approaches to Modelling and Scheduling Manufacturing Processes, 1994.
9. Le Pape C. Implementation of resource constraints in ILOG Schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering 1994; 3(2):55-66.
10. Saks V. Distribution planner overview. Technical Report. Carnegie Group, Inc., Pittsburgh, PA, 15222, 1992.
11. Simon HA. The structure of ill-structured problems. Artificial Intelligence 1973; 4:181-200.
12. Fox MS. Constraint-Directed Search: A Case Study of Job-Shop Scheduling. PhD Thesis. Carnegie Mellon University, Intelligent Systems Laboratory, The Robotics Institute, Pittsburgh, PA., 1983. CMU-RI-TR-85-7.
13. Fox MS, Sadeh N, Baykan C. Constrained heuristic search. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), 1989; 309-316.
14. Sadeh N. Lookahead techniques of micro-opportunistic job-shop scheduling. PhD Thesis. Camegie-Mellon University, 1991. CMU-CS-91-102.
15. Muscettola N. Scheduling by iterative partition of bottleneck conflicts. Technical Report CMU-RI-TR-92-05, The Robotics Institute, Carneigie Mellon University, 1992.
16. Beck JC, Davenport AJ, Sitarski EM, Fox MS. Texture-based heuristics for scheduling revisited. In Proceedings of Fourteenth National Conference on Artificial Intelligence (AAA1-97). AAAI Press: Menlo Park, CA, 1997.
17. Beck JC, Fox MS. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence 2000; 117(1):31-81.
18. Beck JC, Davenport AJ, Davis ED, Fox MS. The ODO project: Toward a unified basis for constraint-directed scheduling. Journal of Scheduling 1998; 1(2):89-125.
19. Le Pape C, Couronné P, Vergamini D, Gosselin V. Time-versus-capacity compromises in project scheduling. In Proceedings of the 13th Workshop of the UK Planning Special Interest Group, 1994.
20. Cheng CC, Smith SF. Applying constraint satisfaction techniques to job shop scheduling. Annals of Operations Research, Special Volume on Scheduling: Theory and Practice 1997; 70:327-378.
21. Lhomme O. Consistency techniques for numeric CSPs. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), vol. 1, 1993; 232-238.
22. Nuijten WPM. Time and resource constrained scheduling: a constraint satisfaction approach. PhD Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1994.
23. Harvey WD, Ginsberg ML. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95) 1995; 607-613.
24. Walsh T. Depth-bounded discrepancy search. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), 1997.
25. Gent IP, Walsh T. The hardest random SAT problems. In Proceedings of KI-94: Advances in Artificial Intelligence, Nebel B, Dreschler-Fischer L (eds). 18th German Annual Conference on Artificial Intelligence. Springer: Berlin, 1994; 355-366.
26. Gent IP, Maclntyre E, Presser P, Walsh T. The constrainedness of search. In Proceedings of the 13th National Conference on Artificial Intelligence (AAA1-96), vol. 1, 1996; 246-252.
27. Beck JC, Jackson K. Constrainedness and the phase transition in job shop scheduling. Technical Report. School of Computing Science, Simon Fraser University, 1997.
28. Cohen PR. Empirical Methods for Artificial Intelligence. The MIT Press: Cambridge, MA, 1995.
29. Régin J-C. A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 12th National Conference on Artificial Intelligence (AAA1-94), vol. 1, 1994; 362-367.
30. Beck JC, Fox MS. Scheduling alternative activities. In Proceedings of Sixteenth National Conference on Artificial Intelligence (AAAI-99). AAAI Press: Menlo Park, CA, 1999.
31. Beck JC, Fox MS. Constraint directed techniques for scheduling with alternative activities. Artificial Intelligence 2000; 121:211-250.