Scheduling by Iterative Partition of Bottleneck Conflicts

Nicola Muscettola
tech. report CMU-RI-TR-92-05, Robotics Institute, Carnegie Mellon University, February, 1992


Download
  • Adobe portable document format (pdf) (710KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
In this paper we describe Conflict Partition Scheduling (CPS), a novel methodology that constructs solutions to scheduling problems by repeatedly identifying bottleneck conflicts and posting constraints to resolve them. The identification of bottleneck conflicts is based on a capacity analysis using a stochastic simulation methodology. Once a conflict is identified, CPS does not attempt to resolve it completely; instead it introduces constraints that merely decrease its criticality. By reducing the amount by which each scheduling decision prunes the search space, CPS tries to minimize the chance of getting lost in blind alleys. Moreover, the capacity analysis metrics computed at each decision step give an indication of the areas of the search space where pruning is more likely to be effective. CPS effectiveness is demonstrated by the results of an extensive experimental analysis that compares it to two current scheduling methods: micro-opportunistic constraint-directed search and min-conflict iterative repair. CPS is shown to significantly outperform both of them on a standard benchmark of constraint satisfaction scheduling problems.

Notes
Sponsor: NASA, DARPA
Grant ID: NCC 2-707, F30602-88-C-001
Associated Center(s) / Consortia: Center for Integrated Manfacturing Decision Systems
Number of pages: 14

Text Reference
Nicola Muscettola, "Scheduling by Iterative Partition of Bottleneck Conflicts," tech. report CMU-RI-TR-92-05, Robotics Institute, Carnegie Mellon University, February, 1992

BibTeX Reference
@techreport{Muscettola_1992_282,
   author = "Nicola Muscettola",
   title = "Scheduling by Iterative Partition of Bottleneck Conflicts",
   booktitle = "",
   institution = "Robotics Institute",
   month = "February",
   year = "1992",
   number= "CMU-RI-TR-92-05",
   address= "Pittsburgh, PA",
}