The Robotics Institute

Carnegie Mellon Robotics Institute

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 investigate the applicability of a constraint satisfaction problem solving (CSP) model, recently developed for deadline scheduling, to more commonly studied problems of schedule optimization. Our hypothesis is two-fold: (1) that CSP scheduling techniques provide a basis for developing high-performance approximate solution procedures in optimization contexts, and (2) that the representational assumptions underlying CSP models allow these procedures to naturally accommodate the idiosyncratic constraints that complicate most real-world applications. We focus specifically on the objective criterion of makespan minimization, which has received the most attention within the job shop scheduling literature. We define an extended solution procedure somewhat unconventionally by reformulating the makespan problem as one of solving a series of different but related deadline scheduling problems, and embedding a simple CSP procedure as the subproblem solver. We first present the results of an empirical evaluation of our procedure performed on a range of previously studied benchmark problems. Our procedure is found to provide strong cost/performance, producing solutions competitive with those obtained using recently reported shifting bottleneck search procedures at reduced computational expense. To demonstrate generality, we also consider application of our procedure to a more complicated, multi-product hoist scheduling problem. With only minor adjustments, our procedure is found to significantly outperform previously published procedures for solving this problem across a range of input assumptions.

Notes

Sponsor: NASA, ARPA

Grant ID: NCC 2-531, F30602-90-C-0119

Number of pages: 41

Text Reference

Cheng-Chung Cheng and Stephen Smith , "Applying Constraint Satisfaction Techniques to Job Shop Scheduling," tech. report CMU-RI-TR-95-03, Robotics Institute, Carnegie Mellon University, January, 1995

BibTeX Reference

@techreport{Smith__1995_362,
   author = "Cheng-Chung Cheng and Stephen {Smith }",
   title = "Applying Constraint Satisfaction Techniques to Job Shop Scheduling",
   booktitle = "",
   institution = "Robotics Institute",
   month = "January",
   year = "1995",
   number= "CMU-RI-TR-95-03",
   address= "Pittsburgh, PA",
}

The Robotics Institute

Menu