Preference-based Search for Scheduling

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 904-909

  Junker, Ulrich ^a  

^a IBM   (United States)

Author keywords

constraint satisfaction; non monotonic reasoning; scheduling; search

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION;

ALL SOLUTIONS; BEST DECISION; COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRAINT SATISFACTION; NON-MONOTONIC REASONING; PREFERENCE-BASED SEARCH; PREFERRED SOLUTIONS; SEARCH; SEARCH PROCEDURES; SIMPLE++;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (13)

1. Brewka, G. 1989. Preferred subtheories: An extended logical framework for default reasoning. In IJCAI-89, 1043-1048. Detroit, MI: Morgan Kaufmann.
2. Cesta, A.; Oddi, A.; and Smith, S. F. 1999. An iterative sampling procedure for resource constrained project scheduling with time windows. In IJCAI-99, 1022-1029.
3. Geffner, H., and Pearl, J. 1992. Conditional entailment: Bridging two approaches to default reasoning. Artificial Intelligence 53:209-244.
4. Grosof, B. 1991. Generalizing prioritization. In KR'91, 289-300. Cambridge, MA: Morgan Kaufmann.
5. ILOG. 1997. Ilog Scheduler. Reference manual and User manual. V4.0, ILOG.
6. Joslin, D. E., and Clements, D. P. 1998.”Squeaky Wheel” Optimization. In AAAI-98, 340-346.
7. Junker, U., and Brewka, G. 1991. Handling partially ordered defaults in TMS. In Kruse, R., and Siegel, P., eds., Symbolic and Quantitative Aspects for Uncertainty. Proceedings of the European Conference ECSQAU. Berlin: Springer, LNCS 548. 211-218.
8. Junker, U., and Konolige, K. 1990. Computing the extensions of autoepistemic and default logics with a truth maintenance system. In AAAI-90, 278-283. Boston, MA: MIT press.
9. Laborie, P., and Ghallab, M. 1995. Planning with sharable resource constraints. In IJCAI-95.
10. Le Pape, C.; Couronné, P.; Vergamini, D.; and Gosselin, V. 1994. Time-versus-capacity compromises in project scheduling. In Proc. of Thirteenth Workshop of the UK Planning Special Interest Group.
11. Minton, S.; Johnston, M. D.; Philips, A. B.; and Laird, P. 1992. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling. Artificial Intelligence 58:161-205.
12. Reiter, R. 1987. A theory of diagnosis from first principles. Artificial Intelligence 32:57-952.
13. Smith, S., and Cheng, C. 1993. Slack-based heuristics for constraint satisfaction scheduling. In AAAI-93.