Heuristics for Constraint-Directed Scheduling with Inventory

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 22-31

  Christopher Beck, J ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CRITICALITY (NUCLEAR FISSION); INVENTORY CONTROL;

INVENTORY CONSTRAINTS; INVENTORY SCHEDULING; INVENTORY/PRODUCTION; PROBLEM STRUCTURE; PRODUCTION AND CONSUMPTION; RESOURCE CONSTRAINT; SCHEDULING APPLICATION; SCHEDULING FRAMEWORKS; SCHEDULING PROBLEM; STORAGE CONSTRAINTS;

INDUSTRIAL RESEARCH;

EID: 84885686552     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Beck, J. C. (1999). Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling. PhD thesis, University of Toronto.
2. Beck, J. C., Davenport, A. J., Davis, E. D., and Fox, M. S. (1998). The ODO project: Toward a unified basis for constraint-directed scheduling. Journal of Scheduling, 1(2):89–125.
3. Beck, J. C., Davenport, A. J., Sitarski, E. M., and Fox, M. S. (1997a). Beyond contention: extending texture-based scheduling heuristics. In Proceedings of Fourteenth National Conference on Artificial Intelligence (AAAI-97). AAAI Press, Menlo Park, California.
4. Beck, J. C., Davenport, A. J., Sitarski, E. M., and Fox, M. S. (1997b). Texture-based heuristics for scheduling revisited. In Proceedings of Fourteenth National Conference on Artificial Intelligence (AAAI-97). AAAI Press, Menlo Park, California.
5. Beck, J. C. and Jackson, K. (1997). Constrainedness and the phase transition in job shop scheduling. Technical report, School of Computing Science, Simon Fraser University.
6. Blazewicz, J., Domschke, W., and Pesch, E. (1996). The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93(1):1–33. Carlier, J. and Pinson, E. (1994). Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78:146–161.
7. Cheng, C. C. and Smith, S. F. (1997). Applying constraint satisfaction techniques to job shop scheduling. Annals of Operations Research, Special Volume on Scheduling: Theory and Practice, 70:327–378.
8. Cohen, P. R. (1995). Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge, Mass.
9. Fox, M. S. (1983). Constraint-Directed Search: A Case Study of Job-Shop Scheduling. PhD thesis, Carnegie Mellon University, Intelligent Systems Laboratory, The Robotics Institute, Pittsburgh, PA. CMU-RI-TR-85-7.
10. Fox, M. S., Sadeh, N., and Baykan, C. (1989). Constrained heuristic search. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), pages 309–316.
11. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York.
12. Gent, I. P., MacIntyre, E., Prosser, P., and Walsh, T. (1996). The constrainedness of search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), volume 1, pages 246–252.
13. Gent, I. P. and Walsh, T. (1994). The hardest random SAT problems. In Nebel, B. and Dreschler-Fischer, L., editors, Proceedings of KI-94: Advances in Artificial Intelligence. 18th German Annual Conference on Artificial Intelligence, pages 355–366. Springer-Verlag.
14. Harvey, W. D. and Ginsberg, M. L. (1995). Limited discrepancy search. In Proceedings of the Fourteenth International Joint Conference onf Artificial Intelligence (IJCAI-95), pages 607–613.
15. Le Pape, C. (1994a). Implementation of resource constraints in ILOG Schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering, 3(2):55–66.
16. Le Pape, C. (1994b). Using a constraint-based scheduling library to solve a specific scheduling problem. In Proceedings of the AAAISIGMAN Workshop on Artificial Intelligence Approaches to Modelling and Scheduling Manufacturing Processes.
17. Le Pape, C., Couronné, P., Vergamini, D., and Gosselin, V. (1994). Time-versus-capacity compromises in project scheduling. In Proceedings of the Thirteenth Workshop of the UK Planning Special Interest Group.
18. Lhomme, O. (1993). Consistency techniques for numeric CSPs. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), volume 1, pages 232–238.
19. Muscettola, N. (1992). Scheduling by iterative partition of bottleneck conflicts. Technical Report CMU-RI-TR-92-05, The Robotics Institute, Carnegie Mellon University.
20. Nuijten, W. P. M. (1994). Time and resource constrained scheduling: a constraint satisfaction approach. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology.
21. Sadeh, N. (1991). Lookahead techniques for micro-opportunistic job-shop scheduling. PhD thesis, Carnegie-Mellon University. CMU-CS-91-102.
22. Saks, V. (1992). Distribution planner overview. Technical report, Carnegie Group, Inc., Pittsburgh, PA, 15222.
23. Simon, H. A. (1973). The structure of ill-structured problems. Artificial Intelligence, 4:181–200.
24. Simonis, H. and Cornelissens, T. (1995). Modelling producer/ consumer constraints. In Montanari, U. and Rossi, F., editors, Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP95), pages 449–462. Springer-Verlag.
25. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64:278–285.
26. Walsh, T. (1997). Depth-bounded discrepancy search. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97).