Evaluating plans through restrictiveness and resource strength

AAAI Workshop - Technical Report

Volumn WS-05-06, Issue , 2005, Pages 17-26

  Pecora, Federico ^a,b   Cesta, Amedeo ^a  

^a CNR   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EVALUATING PLANS; LOOSELY-COUPLED INTEGRATION; RESOURCE CONSTRAINTS; RESOURCE STRENGTHS; STRUCTURAL TRADEMARKS;

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; INTEGRATION; KNOWLEDGE ACQUISITION; SCHEDULING; TRADEMARKS;

STRATEGIC PLANNING;

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

References (28)

1. Alvarez-Valdez, A., and Tamarit, J. 1989. Heuristic Algorithms for Resource-Constrained Project Scheduling: a Review and an Empirical Analysis. In Slowinski, R. and Weglarz, J., ed., Intelligent Scheduling Systems. Elsevier. 113-134.
2. Bäckström, C. 1998. Computational Aspects of Reordering Plans. Journal of Artificial Intelligence Research 9:99-137.
3. Brightwell, G., and Winkler, P. 1991. Counting Linear Extensions. Order 8:225-242.
4. Brucker, P.; Drexl, A.; Mohring, R.; Neumann, K.; and Pesch, E. 1998. Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. European Journal of Operations Research.
5. Cesta, A.; Fratini, S.; and Oddi, A. 2004. Planning with Concurrency, Time and Resources. A CSP-Based Approach. In Vlahavas, I., and Vrakas, D., eds., Intelligent Techniques for Planning. Idea Group Publishing (to appear).
6. Cesta, A.; Pecora, F.; and Rasconi, R. 2004. Biasing the Structure of Scheduling Problems Through Classical Planners. In Proceedings of the Workshop on Integrating Planning into Scheduling (WIPIS) at ICAPS, Whistler, Canada.
7. Cooper, D. 1976. Heuristics for Scheduling Resource-Constrained Scheduling Projects: an Experimental Investigation. Management Science 22:1186-1194.
8. Currie, K., and Tate, A. 1991. O-Plan: The Open Planning Architecture. Artificial Intelligence 52(1):49-86.
9. De Reyck, B., and Herroelen, W. 1996. On the use of the complexity index as a measure of complexity in activity networks. European Journal of Operational Research 91:347-366.
10. Edelkamp, S., and Hoffmann, J. 2004. PDDL2.2: The Language for the Classical Part of the 4th International Plan-ning Competition. Technical report, Technical Report 195 Computer Science Department, University of Freiburg.
11. Fox, M., and Long, D. 2003. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research 20:61-124.
12. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through Stochastic Local Search and Temporal Action Graphs. Journal of Artificial Intelligence Research (JAIR).
13. Ghallab, M., and Laruelle, H. 1994. Representation and Control in IxTeT, a Temporal Planner. In Proceedings of the Second International Conference on AI Planning Systems (AIPS-94).
14. Ghallab, M.; Howe, A.; Knoblock, C.; McDermott, D.; Ram, A.; Veloso, M.; Weld, D.; and Wilkins, D. 1998. PDDL - The Planning Domain Definition Language, AIPS 98 Planning Competition Committee.
15. Hoffmann, J., and Nebel, B. 2001. The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research 14:253-302.
16. Jonsson, A.; Morris, P.; Muscettola, N.; Rajan, K.; and Smith, B. 2000. Planning in Interplanetary Space: Theory and Practice. In Proceedings of the Fifth Int. Conf. on Artificial Intelligence Planning and Scheduling (AIPS-00).
17. Kolisch, R.; Sprecher, A.; and Drexl, A. 1995. Characterization and generation of a general class of resourceconstrained project scheduling problems. Management Science 41(10):1693-1703.
18. Mastor, A. 1970. An Experimental and Comparative Evaluation of Production Line Balancing Tehniques. Management Science 16:728-746.
19. Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01).
20. Moskewicz, M. 2004. mChaff Website at Princeton: http://www.princeton.edu/~chaff/mchaff. html.
21. Muscettola, N.; Smith, S.; Cesta, A.; and D'Aloisi, D. 1992. Coordinating Space Telescope Operations in an Integrated Planning and Scheduling Architecture. In IEEE Control Systems, Vol.12, N.1, 28-37.
22. Pecora, F., and Cesta, A. 2002. Planning and Scheduling Ingredients for a Multi-Agent System. In Proceedings of UK PLANSIG02 Workshop, Delft, The Netherlands.
23. Pecora, F.; Rasconi, R.; and Cesta, A. 2004. Assessing the Bias of Classical Planning Strategies on Makespan-Optimizing Scheduling. In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI-04), August 22nd - 27th, Valencia, Spain.
24. R-Moreno, M.; Oddi, A.; Borrajo, D.; Cesta, A.; and Meziat, D. 2002. Integrating Hybrid Reasoners for Planning & Scheduling. In Proceedings of UK PLANSIG02 Workshop, Delft, The Netherlands.
25. Schwindt, C. 1998. Generation of Resource-Constrained Project Scheduling Problems Subject to Temporal Consraints. Technical report, Universität Karlsruhe. Report WIOR-543.
26. Smith, D. E., and Weld, D. S. 1999. Temporal planning with mutual exclusion reasoning. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 326-337. Morgan Kaufmann Publishers Inc.
27. Srivastava, B. 2000. RealPlan: Decoupling Causal and Resource Reasoning in Planning. In AAAI/IAAI, 812-818.
28. Vidai, V., and Geffner, H. 2004. Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), San Jose, CA.