Integrating planning and scheduling

Applied Artificial Intelligence

Volumn 15, Issue 5, 2001, Pages 471-491

  Garrido, A ^a   Barber, F ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; CONSTRAINT THEORY; GLOBAL OPTIMIZATION; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

PLANNING DOMAIN DEFINITION LANGUAGE; PLANNING SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 0242323410     PISSN: 08839514     EISSN: None     Source Type: Journal    
DOI: 10.1080/088395101300125734     Document Type: Article

References (35)

1. Aylett, R S., G. J Petley, P. W. H. Chung, B. Chen, and D. W. Edwards. 2000. AI planning: Solutions for real world problems. Knowledge-Based Systems 13:61-69.
2. Bäckström, C. 1998. Computational aspects of reordering plans. Journal of Artificial Intelligence Research 9:99-137.
3. Barber, F. 2000 Reasoning on complex disjunctive temporal constraints. Journal of Artificial Intelligence Research 12 35-86.
4. Barret, A., D. Christianson, M. Friedman, K Golden, S. Penberthy, Y. Sun, and D. Weld. 1996. UCPOP V4 0 User's manual. Report technique TR 93-09-06d, Department of Computer Science and Engineering, University of Washington, Seattle, WA.
5. Beck, H. 1993. TOSCA: A novel approach to the management of job-shop scheduling constraints. In Proc. 9th CIM Europe Annual Conference. Realising CIM's Industrial Potential, 138-149.
6. Beck, J. C., and M. S. Fox. 2000. Constraint-directed techniques for scheduling alternative activities. Artificial Intelligence 121:211-250.
7. Blum, A. L., and M. L. Furst. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90:281-300.
8. Currie. K , and A. Tate. 1991. O-Plan: The open planning architecture. Artificial Intelligence 52(1):49-86.
9. Dechter, R., I. Meiri, and J. Pearl. 1991. Temporal constraint networks. Artificial Intelligence 49:61-95.
10. Dechter, R. 1992. From local to global consistency. Artificial Intelligence 55:87-107.
11. Dorn, J., and K. Froeschl. 1993. Scheduling of production processes. England. Ellis Horwood.
12. El-Kholy, A , and B Richards 1996. Temporal and resource reasoning in planning: the parcPLAN approach. In Proc. 12th European Conference on Artificial Intelligence (ECAI 96), 614-618. Budapest.
13. Garrido, A., and E. Onaindía. 1999. Un Algoritmo para la Optimización de Rutas de Transporte, In Proc. 8th Conferencia Española para la Inteligencia Artificial, 2(4):1-8
14. Garrido, A , M. A. Salido, and F. Barber 2000. Scheduling in a planning environment. In Proc. 14th Workshop on New Results in Planning, Scheduling and Design of ECAI-2000, 36-43. Berlin: Germany.
15. Gervasio, M , and G. DeJong. 1992. A completable approach to integrating planning and scheduling. In Proc. 1st Int. Conf (AIPS-92), Artificial Intelligence Planning System. San Mateo, CA: Morgan Kaufmann, 275-276.
16. Ghallab, M., and H. Laruelle 1994. Representation and control in IxTeT, a temporal planner. In Proc. 2nd Int Conf. on AI Planning Systems, 61-67.
17. Ghallab, M , A. Howe, C. Knoblock, D. McDermott, A. Ram, M. Veloso, D. Weld, and D. Wilkins. 1998. PDDL-The planning domain definition language. AIPS-9S planning competition committee: ftp:// ftp.cs.yale edu/pub/mcdermott/software/pddl tar.gz
18. Kumar, V. 1992. Algorithms for constraint satisfaction problems: A survey. AI Magazine 13(1):32-44.
19. Long, D., M. Fox, L. Sebastia, and A. Coddington. 2000. An examination of resources in planning. In Proc. Workshop of the UK Planning and Scheduling Special Interest Group, 89-100. UK: Open University.
20. Muscettola, N. 1994. HSTS: Integrating planning and scheduling. In M. Zweben and M. Fox, ed., Intelligent Scheduling, 169-212. San Mateo, CA: Morgan Kaufmann.
21. Nau, D., S. Gupta, and W. Regli. 1995. Artificial intelligence planning versus manufacturing-operation planning: A case study. In Proc. 14th Int. Joint Conf. on AI, 1670-1676.
22. Onaindía, E., F. Barber, V. Botti, C. Carrascosa, M. A. Hernández, and M. Rebollo. 1998. A progressive heuristic search algorithm for the cutting stock problem. Lecture Notes in Artificial Intelligence (1416). Springer-Verlag, 25-35.
23. Sadeh, N. M., and M. S. Fox. 1996. Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem Artificial Intelligence, 86:1-41.
24. Sauer J. 2000. Knowledge-based systems techniques and applications in scheduling. Knowledge- based Systems Techniques and Applications, 4:1293-1325.
25. Smith, S. F. 1992. Knowledge-based production management: Approaches, results, and prospects. Production Planning and Control 3(4):53-87.
26. Smith, S. F. 1995. Reactive scheduling systems. Norwell, MA: Kluwer.
27. Smith, D. E., and D. S. Weld. 1999. Temporal planning with mutual exclusion reasoning. In Proc. 16th Int. Joint Conf. on AI (IJCAI-99), 326-337. Stockholm, Sweden.
28. Smith, D. E., J. Frank, and A. K. Jónsson. 2000. Bridging the gap between planning and scheduling. Knowledge Engineering Review 15(1):47-83.
29. Srivastava, B., and S Kambhampati. 1999a. Efficient planning through separate resource scheduling. In Proc. AAAI Spring Symp. on Search Strategy under Uncertain and Incomplete Information, 30-35.
30. Srivastava, B., and S. Kambhampati. 1999b. Scaling up planning by teasing out resource scheduling. In Proc. European Conference of Planning.
31. Tsang, E. 1993. Foundations of constraint satisfaction. New York Academic Press.
32. Tsang, E. 1995. AIP scheduling techniques - A comparative study. British Telecom Technology Journal 13(1):16-28.
33. Wallace, M. 1996. Practical applications of constraint programming. Constraints 1:139-168.
34. Weld, D. 1994. An introduction to least commitment planning. AI Magazine 15(4):93-123.
35. Yang, Q. 1997. Intelligent planning. A decomposition and abstraction based approach. Berlin: Heidelberg: Springer- Verlag.