Maximizing flexibility: A retraction heuristic for oversubscribed scheduling problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1218-1223

  Kramer, Laurence A ^a   Smith, Stephen F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COSTS; CONTENTION-BASED; MISSION SCHEDULING; PROBLEM DATUM; RESOURCE CAPACITY; RETRACTION HEURISTICS; SCHEDULING PROBLEM; TIME FRAME;

ARTIFICIAL INTELLIGENCE; REPAIR;

SCHEDULING;

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

References (18)

1. J.C. Beck. Texture measurements as a Basis for Heuristic Commitment Techniques in Constraint-Directed Scheduling. PhD thesis, Dept. of Computer Science, University of Toronto, 1999.
2. M.A Becker and S.F Smith. Mixed-initiative resource management: The amc barrel allocator. In Proc. 5th Int. Conf. on AI Planning and Scheduling, pages 32-41, Breckenridge CO, April 2000.
3. J. Bresina. Heuristic-baised stochastic sampling. In Proceedings 13th national Conference on AI, pages 271-278, Portland OR, 1996. AAA1 Press.
4. V. Cicirello and S.F Smith. Amplification of search performance through randomization of heuristics. In Proc. 8th Int. Conf on Principles and Practice of Constraint Programming, Ithaca NY, Sept 2002. Springer-Verlag.
5. J. Frank, A. Jonsson, R. Morris, and Smith D.E. Planning and scheduling for fleets of earth observing satellites. In Proc. 6th Int. Symposium on AI, Robotics and Automation for Space, 2001.
6. M.D. Johnston and G. Miller. Spike: Intelligent scheduling of hubble space telescope observations. In M. Zweben and M. Fox, editors, Intelligent Scheduling. Morgan Kaufmann Publishers, 1994.
7. D.E. Joslin and D.P. Clements. Squeakywheel optimization. In Proc. 15th National Conference on AI, Madison Wl, July 1998. AAA1 Press.
8. L. Kramer and S.F Smith. Optimizing for change: Mixed-initiative resource management with the amc barrel allocator. In Proc. 3rd Int. Workshop on Planning and Scheduling for Space, Houston, Oct 2002.
9. S. Minton, M.D. Johnson, A.B Philips, and P. Laird. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1): 161-205,1992.
10. T.E. Morton and D.W. Pentico. Heuristic scheduling Systems. John Wiley and Sons, 1993.
11. J.C. Pemberton. Toward scheduling over-constrained remote-sensing satellites. In Proceedings 2nd Int. NASA Workshop on Planning and Scheduling for Space, San Francisco, CA, March 2000.
12. S. Prestwich. Local search and backtracking vs non-systematic backtracking. In Proc. AAA1 Fall Symposium on Using Uncertainty within Computation, North Falmouth, MA, Nov 2001.
13. G. Rabideau, R. Knight, S. Chien, A. Fukanaga, and A. Govindjee. Iterative planning for spacecraft operations using the aspen system. In Proc. 5th Int. Sym. on Ah Robotics and Automation for Space, 1999.
14. N. Sadeh. Look-Ahead techniques for Micro-Opportunistic Job Shop Scheduling. PhD thesis, Dept. of Computer Science, Carnegie Mellon University, 1991.
15. S.F Smith and C. Cheng. Slack-based heuristics for constraint satisfaction scheduling. In Proc. 11th National Conference on Artificial Intelligence, pages 139-144, Wash DC, July 1993. AAA1 Press.
16. S.F. Smith. Opis: A methodology and architecture for reactive scheduling. In M. Zweben and M. Fox, editors, Intelligent Scheduling. Morgan Kaufmann, 1994.
17. G. Verfaillie and T. Schiex. Solution reuse in dynamic constraint satisfaction problems. In Proc. 12th National Conf. on AI, Seattle WA, Aug 1994.
18. M. Zweben, B. Daun, E. Davis, and M. Deale. Scheduling and rescheduling with iterative repair. In M. Zweben and M. Fox, editors, Intelligent Scheduling. Morgan Kaufmann Publishers, 1994.