Linear relaxation techniques for task management in uncertain settings

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 363-371

  Varakantham, Pradeep ^a   Smith, Stephen F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR RELAXATIONS; SIMPLE TEMPORAL PROBLEMS; SOLUTION TECHNIQUES; TASK MANAGEMENTS; TIME CONSTRAINTS; WORK FLOWS;

SCHEDULING;

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

References (22)

1. Barbulescu, L.; Whitley, D. L.; and Howe, A. E. 2004. Leap before you look: An effective strategy in an oversubscribed scheduling problem. In American Association of Artificial Intelligence.
2. Beck, C. J., and Wilson, N. 2007. Proactive algorithms for job shop scheduling with probabilistic durations. Journal of Articial Intelligence Research 28:183-232.
3. Bellotti, V.; Ducheneaut, N.; Howard, M.; Smith, I.; and Grinter, R. 2005. Quality versus quantity: Email centric task management and its relation with overload. Human-Computer Interaction Journal 20:89-138.
4. Birge, J., and Teboulle, M. 1989. Upper bounds on the expected value of a convex function using gradient and con-
5. jugate function information. Mathematics of Operations Research 14(4).
6. Chalupsky, H.; Gil, Y.; Knoblock, C.; Lerman, K.; Oh, J.; Pynadath, D.; Russ, T.; and Tambe, M. 2001. Electric Elves: Applying agent technology to support human organizations. In Innovative Applications of Artificial Intelligence Conference, 51-58.
7. Conley, K., and Carpenter, J. 2007. Towel: Towards an intelligent to-do list. In AAAI Spring Symposium.
8. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence Journal 49:61-95.
9. Frank, J.; Jonsson, A.; Morris, R.; and Smith, D. 2001. Planning and scheduling for fleets of earth observing satellites. In Proceedings of the 6th International Symposium on Artificial Intelligence, Robotics, Automation and Space.
10. Gallagher, A.; Zimmerman, T.; and Smith, S. 2006. Incremental scheduling to maximize quality in a dynamic environment. In International Conference on Automated Planning and Scheduling.
11. Joslin, D. E., and Clements, D. P. 1999. Squeaky wheel optimization. Journal of Artificial Intelligence Research 10:353-373.
12. Khatib, L.; Morris, P.; Morris, R.; and Rossi, F. 2001. Temporal constraint reasoning with preferences. In International Joint Conference on Artificial Intelligence.
13. Kramer, L., and Smith, S. 2003. Maximizing flexibility: A retraction heuristic for over-subscribed scheduling problems. In International Joint Conference on Artificial Intelligence.
14. Lau, H.; Li, J.; and Yap, R. 2006. Robust controllability of temporal constraint networks under uncertainty. In International Conference on Tools with Artificial Intelligence.
15. Locatelli, F.; Magni, P.; and Bellazzi, R. 1998. Using uncertainty management techniques in medical therapy planning: A decision-theoretic approach. In Applications of Uncertainty Formalisms.
16. Morris, P., and Muscettola, N. 2005. Temporal dynamic controllability revisited. In International Joint Conference on Artificial Intelligence.
17. Rossi, F.; Venable, K. B.; and Yorke-Smith, N. 2006. Uncertainty in soft temporal constraint problems: a general framework and controllability algorithms for the fuzzy case. Journal of Artificial Intelligence Research 27:617-674.
18. Schurr, N., and Tambe, M. 2006. Using multiagent teams to improve the training of incident commanders. In Autonomous Agents and Multi Agent Systems, Industry Track.
19. Smith, S., and Cheng, C. 1993. Slack-based heuristics for constraint satisfaction scheduling. In American Association of Artificial Intelligence.
20. Stumpf, S.; Bao, X.; Dragunov, A.; Dietterich, T.; Herlocker, J.; Johnsrude, K.; Li, L.; and Shen, J. 2005. The tasktracer system. In American Association of Artificial Intelligence.
21. Taskar, B. 2004. Learning structured prediction models: A large margin approach. Technical Report: Stanford University.
22. Vidal, T., and Fargier, H. 1999. Handling contingency in temporal constraint networks: from consistency to controllabilities. Journal of Experimental and Theoretical Artificial Intelligence 11(1):23-45.