Search
Navigator: RI | Research | Projects | AMC Barrelmaster Scheduling
Graphics enhanced version of this site
AMC Barrelmaster Scheduling
Head: Stephen Smith
Contact: Stephen Smith (sfs@cs.cmu.edu)
Mailing address:
Carnegie Mellon University
Robotics Institute
5000 Forbes Avenue
Pittsburgh, PA 15213
Associated center: CIMDS
Associated lab/group: Intelligent Coordination and Logistics Laboratory
For more information, see this project's homepage.
Jump to:
Project Description |
Personnel |
Publications
Project Description
Efficient allocation of aircraft and crews to transportation missions is an important priority at the Air Mobility Command (AMC), where airlift demand must increasingly be met with less capacity and at lower cost. Due to overall problem scale and the time pressure of decision-making, the AMC "Barrel Masters" responsible for making allocation decisions routinely miss opportunities to optimize resource usage.
Using the
OZONE Scheduling Framework, we have developed a mixed-initiative scheduling tool for generating and evaluating such optimization oppotunities. Experimental results with this "Barrel Allocator" tool using actual historical data have indicated the potential for substantial reduction in non-productive flying time, through better optimization of wing assignments, selective combination of missions to efficiently "recycle" aircraft, and more effective integration of tanker and airlift missions. Following positive review by AMC personnel, a version of Barrel Allocator has been installed in the Tanker Airlift Command Center (TACC) at AMC for extended user review and testing. Current plans call for Barrel Allocator to go into operational use within the TACC in August, 1999 as part of release 2.0 of AMC's new Consolidated Air Mobility Planning System (CAMPS).
Barrel Allocator has been developed as part of the Advanced Automated Scheduling (AAS) component of the CAMPS development effort, which is aimed specifically at applying and transitioning new scheduling technologies developed within the DARPA/RL Planning Initiative. The Barrel Allocator relies on incremental, constraint-based scheduling techniques. This allows selective re-optimization of allocation decisions to accommodate new, higher priority missions while minimizing disruption to most previous assignments. Mission scheduling and resource allocation capabilities can be invoked in automated or semi-automated modes. In the latter case, the system generates and compares different options that might be taken. Planners interact with Barrel Allocator through graphical displays, which incorporate mission-oriented, resource-resource and map-based views of the current set of commitments.
Personnel [Past Members]
Recent publications [View all 13 publications]
- Airlift Mission Monitoring and Dynamic Rescheduling
D.E. Wilkins, S. Smith, L. Kramer, T. Lee, and T. Rauenbusch
Engineering Applications of Artificial Intelligence, Vol. 21, No. 2, March, 2008.
[Abstract]
- Searching Alternate Spaces to Solve Oversubscribed Scheduling Problems
L. Kramer, L. Barbulescu, and S. Smith
tech. report CMU-RI-TR-08-12, Robotics Institute, Carnegie Mellon University, March, 2008.
[Abstract]
Download: pdf [278 KB] copyrighted
- Benchmark Problems for Oversubscribed Scheduling
L. Barbulescu, L. Kramer, and S. Smith
Workshop on Scheduling a Scheduling Competition, The 17th International Conference on Automated Planning & Scheduling (ICAPS-07), September, 2007.
[Abstract]
Download: pdf [90 KB] copyrighted
- Analyzing Basic Representation Choices in Oversubscribed Scheduling Problems
L. Kramer, L. Barbulescu, and S. Smith
Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Application (MISTA-07), August, 2007.
[Abstract]
Download: pdf [157 KB] copyrighted
- Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
L. Kramer, L. Barbulescu, and S. Smith
Proceedings 22nd Conference on Artificial Intelligence (AAAI-07), July, 2007.
[Abstract]
Download: pdf [171 KB] copyrighted
- Resource Contention Metrics for Oversubscribed Scheduling Problems
L. Kramer and S. Smith
Proceedings 16th International Conference on Automated Planning and Scheduling (ICAPS-06), June, 2006.
[Abstract]
Download: pdf [127 KB] copyrighted
- The AMC Scheduling Problem: A Description for Reproducibility
L. Kramer and S. Smith
tech. report CMU-RI-TR-05-75, Robotics Institute, Carnegie Mellon University, November, 2005.
[Abstract]
Download: pdf [155 KB] copyrighted
- Maximizing Availability: A Commitment Heuristic for Oversubscribed Scheduling Problems
L. Kramer and S. Smith
Proceedings 15th International Conference on Automated Planning and Scheduling, June, 2005.
[Abstract]
Download: pdf [188 KB] copyrighted
- Task Swapping for Schedule Improvement: A Broader Analysis
L. Kramer and S. Smith
Proceedings 14th International Conference on Automated Planning and Scheduling, June, 2004.
[Abstract]
Download: pdf [146 KB] copyrighted
- Continuous Management of Airlift and Tanker Resources: A Constraint-Based Approach
S. Smith, M. Becker, and L. Kramer
Mathematical and Computer Modeling -- Special Issue on Defense Transportation: Algorithms, Models and Applications for the 21st Centry, Vol. 39, No. 6-8, 2004, pp. 581-598.
[Abstract]
Download: pdf [179 KB] copyrighted
The Robotics Institute is part of the
School of Computer Science,
Carnegie Mellon University.
For updates and comments, please see these
instructions.
This page maintained by robotwebmaster@ri.cmu.edu