Retaining flexibility to maximize quality: When the scheduler has the right to decide activity durations

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 212-221

  Wang, Xiaofang ^a   Smith, Stephen F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BETTER PERFORMANCE; DEGREE OF FREEDOM; EXACT COMPUTATIONS; EXPERIMENTAL ANALYSIS; LINEAR OPTIMIZATION; PRECEDENCE CONSTRAINT POSTINGS; RESOURCE CONSTRAINED SCHEDULING; SCHEDULING PROBLEM;

ALGORITHMS; OPTIMIZATION;

SCHEDULING;

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

References (31)

1. Ajili, F. and El Sakkout, H. 2003. A probe-based algorithm for piecewise linear optimization in scheduling. Annals of Operations Research 118:35-48.
2. Baptiste, P.; Le Pape, C. and Nuijten, W. 2001. Constraint- based Scheduling: Applying Constraint Programming to Scheduling Problems. Norwell, MA: Kluwer Academic Publishers.
3. Beck, J. 1999. Texture Measurements as a Basis for Heuristic Commitment Techniques in Constraint-Directed Scheduling. Ph.D. Dissertation. Dept. of Computer Science, University of Toronto.
4. Beringer, H. and De Backer, B. 1995. Logic Programming: Formal Methods and Practical Applications. Amsterdam, Holland: Elsevier Science, chapter Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers.
5. Cesta, A.; Oddi, A. and Smith, S. 2000. Iterative flattening: A scalable method for solving multi-capacity schedul- ing problems. In Proceedings of the Seventeenth National Conference in Artificial Intelligence (AAAI'OO).
6. Cesta, A.; Oddi, A. and Smith, S. 2002. A constraint- based method for project scheduling with time windows. Journal of Heuristics 8(1): 109-136.
7. Cheng, C. and Smith, S. 1996. A constraint satisfaction approach to makespan scheduling. In Proceedings 4th International Conference on Artificial Intelligence Planning Systems.
8. Dean, T. L., and Boddy, M. 1988. An analysis of time- dependent planning. In Proceedings of 7th National Conference on Artificial Intelligence, 49-54. St. Paul, MN: AAAI Press.
9. El Sakkout, H and Wallace, M. 2000. Backtrack search for minimal perturbation in dynamic scheduling. Constraints, Special Issue on Industrial Constraint-Directed Scheduling 5(4).
10. El Sakkout, H.; Wallace, M. and Richards, T. 1998. Minimal perturbation in dynamic scheduling. In Proc. of the 13th European Conference on Artificial Intelligence (ECAI-98).
11. Fulkerson, D. 1961. A network flow computation for project cost curves. Management Science 7(2): 167-178.
12. Hooker, J. N. 2004. A hybrid method for planning and scheduling. In Tenth International Conference on Principles and Practice of Constraint Programming (CP 2004).
13. Horvitz, E. 1987. Reasoning about beliefs and actions under computational resource constraints. In Third Workshop on Uncertainty in Artificial Intelligence.
14. Icmeli, O. and Erenguc, S. 1996. The resource constrained time-cost tradeoff project scheduling problem with discounted cash flows. Journal of Operations Management 14:255-275.
15. Kelley Jr., J. and Walker, M. 1959. Critical Path Planning and Scheduling: An introduction. Ambler, Pa: Mauchly Associates Inc.
16. Kelley Jr., J. 1961. Critical path planning and scheduling: Mathematical basis. Operations Research 9(3):296-320.
17. Khatib, L.; Morris, P. H.; Morris, R. A. and Rossi, F. 2001. Temporal constraint reasoning with preference. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence.
18. Nuijten, W. and Aarts, E. 1994. Constraint satisfaction for multiple capacitated job-shop scheduling. In Proceedings of the 11th European Conference on Artificial Intelligence.
19. Oddi, A. and Cesta, A. 1997. A tabu search strategy to solve scheduling problems with deadlines and complex metric constraints. In Proceedings of the 4th European Conference on Planning.
20. Philips, S. and Dessouky, M. 1977. Solving the project time-cost tradeoff problem using the minimal cut concept. Management Science 24(4):393-400.
21. Policella, N.; Smith, S. F.; Cesta, A. and Oddi, A. 2004. Generating robust schedules through temporal flexibility. In Proceedings 14th International Conference on Automated Planning and Scheduling.
22. Russel, S. and Wefald, E. 1991. Do the Right Thing: Studies in Limited Rationality. Cambridge, MA: MIT Press.
23. Sadeh, N. 1991. Look-Ahead techniques for Micro- Opportunistic Job Shop Scheduling. Ph.D. Dissertation, Dept. of Computer Science, Carnegie Mellon University.
24. Schwarzfischer, T. 2003a. Application of simulated annealing to anytime scheduling problems with additional timing constraints. In Proceedings of the Fifth Metaheuristics International Conference.
25. Schwarzfischer, T. 2003b. Quality and utility-towards a generalization of deadline and anytime scheduling. In Proceedings of the 13th International Conference on Automated Planning and Scheduling.
26. Schwarzfischer, T. 2003c. Using value dependencies to schedule complex soft-real-time applications with precedence constraints. In Proceedings of the 1st Multidisci- plinary International Conference on Scheduling: Theory and Applications.
27. Slowinski, R. 1980. Two approaches to problems of resource allocation among project activities- A comarative study. J.Operational Research Society 31(8):711-723.
28. Slowinski, R. 1981. Multiobjective network scheduling with efficient use of renewable and non-renewable resources. European J.Operational Research 7(3):711-723.
29. Talbot, F. 1982. Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science 28(10):1197-1210.
30. Wang, X. and Smith, S. 2004. A precedence-constraint- posting procedure to generate schedules maximizing quality with anytime property. Technical Report TR-04-25, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA.
31. Zilberstein, S. 1993. Operational rationality through compilation of anytime algorithms. Ph.D. Dissertation, Computer Science Division, University of California at Berkeley.