Tractable optimal competitive scheduling

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 73-82

  Frank, Jeremy ^a   Crawford, James ^a   Khatib, Lina ^a,b   Brafman, Ronen ^a,c  

^a NASA AMES RESEARCH CENTER   (United States)

^b QSS ^*  (United States)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FEASIBILITY WINDOWS; LINEAR PROGRAMS; POLYNOMIAL TIME; SCHEDULE QUALITY;

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DECISION MAKING; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; SCHEDULING; SET THEORY;

COMPETITIVE INTELLIGENCE;

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

References (17)

1. d International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 34-48, 2005.
2. J. Bresina. Heuristic-biased stochastic sampling. In Proceedings of the 13th National Conference on Artificial Intelligence, 1996.
3. P. Brücker. Scheduling Algorithms. Springer, 1998.
4. th National Conference on Artificial Intelligence, 2004.
5. R. Dechter. Constraint Processing. Morgan Kauffmann, 2003.
6. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61-94, 1991.
7. th International Geoscience and Remote Sensing Symposium, 2005.
8. M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
9. th National Conference on Artificial Intelligence, pages 67-72, 2004.
10. J. Larrosa and P. Meseguer. Boosting search with variable elimination in constraint optimization and constraint satisfaction problems. Journal of Constraints, 8(3):303-326, 2003.
11. th International Conference on the Principles and Practices of Constraint Programming, pages 408 -422, 2004.
12. th International Conference on Automated Planning and Scheduling, 2005.
13. D. J. Rose and R. E. Tarjan G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Computing, 5:266-283, 1976.
14. H. D. Sherali and F. Nordai. NP-hard, capacitated, balanced p-median problems on a chain graph. Mathematics of Operations Research, 13(1):32-49, 1988.
15. th National Conference on Artificial Intelligence, pages 90-96, 2000.
16. W. Wolfe and S. Sorensen. Three scheduling algorithms applied to the earth observing domain. Management Science, 46(1), 2000.
17. X. Wang and S. Smith. Retaining flexibility to maximize quality: When the scheduler has the right to decide activity duration. In Proceedings of the International Conference on Automated Planning and Scheduling, 2005.