Modelling planning and scheduling problems with time and resources

Recent Advances in Computers, Computing and Communications

Volumn , Issue , 2002, Pages 104-109

  Barták, Roman ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Modelling; Planning; Resources; Scheduling; Time

Indexed keywords

COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; QUALITY CONTROL; REAL TIME SYSTEMS; SCHEDULING; STRATEGIC PLANNING; TECHNOLOGY;

MODELLING LANGUAGE; PLANNING PROBLEMS; SCHEDULING MODULES; TIME;

RESOURCE ALLOCATION;

EID: 4944263885     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Article

References (20)

1. th Workshop of the UK Planning and Scheduling SIG, Manchester, pp. 28-39, 1999.
2. Barták R. and Rudová H.: Integrated Modelling for Planning, Scheduling, and Timetabling Problems. In Proceedings of of PLANSIG 2001, pp. 19-31, Edinburgh, UK, 2001.
3. Binh Do M. and Kambhampati S.: Solving planning-graph by compiling it into CSP. In Proceedings of AIPS 2000, pp. 89-91, 2000.
4. Brenner M.: A Formal Model for Planning with Time and Resources in Concurrent Domains, hi Proceedings of IJCAI-01 Workshop Planning with Resources, Seattle, 2001.
5. Brucker P.: Scheduling Algorithms. Springer Verlag, 2001.
6. Coddington A., Fox M., Long D.: Handling Durative Actions in Classical Planning Frameworks. In Proceedings of PLANSIG 2001, pp. 44-58, Edinburgh, UK, 2001.
7. th International Conference on AI Planning Systems, pp. 249-254, 1994.
8. Fikes R. and Nilsson N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, pp. 189208, 1971.
9. Fox M. and Long L.: PDDL 2.1: An extension to PDDL for expressing temporal planning domains. Technical Report, Department of Computer Science, University of Durham, UK, 2001.
10. Ghallab M., Howe A., Knoblock C., McDermott D., Ram A., Veloso M., Weld D., Wilkins D.: PDDL - The Planning Domain Definition Language, Tech Report CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, 1998.
11. Kingston J.H.: Modelling Timetabling Problems with STTL. In Proceedings of The Practice and Theory of Automated Timetabling, LNCS 2079, Springer Verlag, pp. 309-321, 2001.
12. th European Conference on Artificial Intelligence, Brighton, pp. 489-493, 1998.
13. th European Conference on Planning, Toledo, 2001.
14. rd International Workshop on Communication-Based Systems, 2000.
15. Porteous J. and Sebastia L.: Extracting and Ordering Landmarks for Planning. In Proceedings of PLANSIG 2000, pp. 161-174, Milton Keynes, UK, 2000.
16. Smith D.E, Frank J., and Jónsson A.K.: Bridging the Gap Between Planning and Scheduling. In Knowledge Engineering Review, 15(1), pp. 61-94, 2000.
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. Van Beek P. and Chen, X.: CPlan: A Constraint Programming Approach to Planning. In Proceedings of AAAI-99, pp. 585-590, 1999.
19. Wallace, M.: Applying Constraints for Scheduling, in: Constraint Programming, Mayoh B. and Penjaak J. (Eds.), NATO ASI Series, Springer Verlag, 1994.
20. Wren A.: Scheduling, Timetabling and Rostering - A Special Relationship. In Proceedings of The Practice and Theory of Automated Timetabling, LNCS 1153, Springer Verlag, pp. 46-76, 1996.