Oversubscribed Planning & Scheduling Workshop
In many planning and scheduling applications it is not possible to achieve all requested goals. For example, in space mission scheduling it may not be possible to observe all of the requested targets. Similarly, in manufacturing it may not be possible to fulfill all of the production orders. This workshop targets problems and techniques for planning and scheduling problems where it is not possible to achieve all of the problem goals. As such, it often includes representation of optimization, preferences, and/or cost to provide guidance as to desirability over partial solutions. The topics of discussion at this workshop include:
- algorithms for oversubscribed planning and scheduling
- hybrid techniques for oversubscribed planning and scheduling
- application areas involving oversubscribed planning and scheduling
- comparison of planning and scheduling approaches to oversubscribed problems in both deployed applications and testbed problem sets
- evaluation of techniques for oversubscribed planning & scheduling
- operations research based approaches
- methods of representing preferences, objective functions, etc.
Important Dates
| Deadline for papers: | June 18, 2008 EXTENDED to June 25, 2008 |
| Notification of acceptance: | July 11, 2008 EXTENDED to July 25, 2008 |
| Final revisions: | July 25, 2008 EXTENDED to Aug 15, 2008 |
| Workshop date: | September 14, 2008 |
Organizers
- Laura Barbulescu, Carnegie-Mellon University. laurabar at cs.cmu.edu
- Steve Chien, Jet Propulsion Laboratory. Steve.Chien at jpl.nasa.gov
- Mark Giuliano, Space Telescope Science Institute. giuliano at stsci.edu
- Rob Sherwood, Jet Propulsion Laboratory. Rob.Sherwood at jpl.nasa.gov
Program Committee
- Minh Do, Palo Alto Research Center
- Adele Howe, Colorado State University
- Mark Johnston, Jet Propulsion Laboratory
- Subbarao Kambhampati, Arizona State University
- David Smith, NASA Ames
- Steve Smith, Carnegie Mellon University
