Using decision procedures efficiently for optimization

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 312-319

  Streeter, Matthew ^a   Smith, Stephen F ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BRANCH AND BOUND METHOD;

DECISION PROCEDURE; MULTIPLE OPTIMIZATIONS; OPTIMAL PLAN; OPTIMAL SOLUTIONS; OPTIMISATIONS; OPTIMIZATION PROBLEMS; POWER; QUERY STRATEGIES; SIMPLE++; THEORETICAL GUARANTEES;

JOB SHOP SCHEDULING;

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

References (13)

1. Auer, P.; Cesa-Bianchi, N.; Freund, Y.; and Schapire, R. E. 2002. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing 32(1):48-77.
2. Beasley, J. E. 1990. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11):1069-1072.
3. Blum, A. L., and Furst, M. L. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90:281-300.
4. Brucker, P.; Jurisch, B.; and Sievers, B. 1994. A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49(1-3):107-127.
5. Cesa-Bianchi, N.; Lugosi, G.; and Stoltz, G. 2005. Minimizing regret with label efficient prediction. IEEE Transactions on Information Theory 51:2152-2162.
6. Feige, U.; Lovász, L.; and Tetali, P. 2004. Approximating min sum set cover. Algorithmica 40(4):219-234.
7. Hsu, C.-W.; Wah, B. W.; Huang, R.; and Chen, Y. 2006. New features in SGPlan for handling preferences and constraints in PDDL3.0. In Proceedings of the Fifth International Planning Competition, 39-42.
8. Kautz, H.; Selman, B.; and Hoffmann, J. 2006. SATPLAN: Planning as satisfiability. In Proceedings of the Fifth International Planning Competition.
9. Knuth, D. E. 1971. Optimum binary search trees. Acta Informatica 1:14-25.
10. Korf, R. E. 1985. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
11. Rintanen, J. 2004. Evaluation strategies for planning as satisfiability. In Proceedings of the Sixteenth European Conference on Artificial Intelligence, 682-687.
12. Streeter, M. J., and Smith, S. F. 2006. Exploiting the power of local search in a branch and bound algorithm for job shop scheduling. In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 324-332.
13. Xing, Z.; Chen, Y; and Zhang, W. 2006. MaxPlan: Optimal planning by decomposed satisfiability and backward reduction. In Proceedings of the Fifth International Planning Competition, 53-56.