Dynamic constraint models for planning and scheduling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1865, Issue , 2000, Pages 237-255

  Barták, Roman ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPERATIONS RESEARCH;

COMPLEX PROCESSES; CONSTRAINT PROGRAMMING; DYNAMIC CONSTRAINTS; PLANNING AND SCHEDULING; PLANNING CAPABILITY; PROBLEM AREAS; SCIENCE COMMUNITY;

SCHEDULING;

EID: 84957026045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44654-0_12     Document Type: Conference Paper

References (19)

1. Baptiste, P., Le Pape, C., Nuijten, W.: Constraint Based Optimisation and Approximation for Job-Shop Scheduling. Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI-95, Montreal, Canada (1995).
2. Barták, R.: On-line Guide to Constraint Programming. Charles University, Prague, http://kti.mff.cuni.cz/~bartak/constraints/.
3. Barták, R.: VisOpt – the Solver behind the User Interaction. White Paper, InSol Ltd., Israel (1999), available at URL http://www.visopt.com/.
4. Barták, R.: Conceptual Models for Combined Planning and Scheduling. Proceedings of the CP99 Post-conference Workshop on Large Scale Combinatorial Optimisation and Constraints, Alexandria, USA (1999) 2-14.
5. Barták, R.: On the Boundary of Planning and Scheduling: A Study. Proceedings of the Eighteenth Workshop of the UK Planning and Scheduling Special Interest Group, Manchester, UK (1999) 28-39.
6. Blum, A. L. and Furst, M. L.: Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90 (1997) 281-300.
7. Brusoni, V., Console, L., Lamma, E, Mello, P, Milano, M, Terenziani, P.: Resourcebased vs. Task-based Approaches for Scheduling Problems. Proceedings of the 9th ISMIS96, LNCS Series, Springer Verlag (1996).
8. Caseau, Y., Laburthe, F.: Improved CLP Scheduling with Task Intervals. Proceedings of ICLP94, MIT Press, (1994) 369-383.
9. Caseau, Y., Laburthe, F.: Cumulative Scheduling with Task Intervals. Proceedings of JICSLP96, MIT Press (1996) 363-337.
10. Caseau, Y., Laburthe, F.: A Constraint based approach to the RCPSP. Proceedings of the CP97 Workshop on Industrial Constraint-Directed Scheduling, Schloss Hagenberg, Austria (1997).
11. Crawford, J.M.: An Approach to Resource Constrained Project Scheduling. Artificial Intelligence and Manufacturing Research Planning Workshop (1996).
12. Joslin, D. and Pollack, M.E.: Passive and Active Decision Postponement in Plan Generation. Proceedings of the Third European Conference on planning (1995).
13. Fikes, R. E. and Nilsson, N. J.: STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 3-4 (1971) 189-208.
14. Nareyek, A.: AI Planning in a Constraint Programming Framework. Proceedings of the Third International Workshop on Communication-Based Systems (2000), to appear.
15. Pegman, M.: Short Term Liquid Metal Scheduling. Proceedings of PAPPACT98 Conference, London (1998) 91-99.
16. Pool, D., Mackworth, A., Goebel, R.: Computational Intelligence – A Logical Approach, Oxford University Press, Oxford (1998).
17. Srivastava, B. and Kambhampati, S.: Scaling up Planning by teasing out Resource Scheduling. Technical Report ASU CSE TR 99-005, Arizona State University (1999).
18. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1995).
19. Wallace, M.: Applying Constraints for Scheduling. Constraint Programming, Mayoh B. and Penjaak J. (Eds.), NATO ASI Series, Springer Verlag (1994).