A constraint-posting framework for scheduling under complex constraints

Scheduling in many practical industrial domains is complicated by the need to account for diverse and idiosyncratic constraints. Research in temporal reasoning and constraint satisfaction has produced problem solving models that operate with respect to general representational assumptions. These frameworks offer possibilities for developing scheduling technologies that naturally extend to accommodate the peculiarities of various application domains. One critical issue is whether such generality can be obtained without sacrificing scheduling performance. We investigate this issue through application of a previously developed constraint satisfaction problem solving (CSP) model for deadline scheduling to a complicated, multiproduct hoist scheduling problem encountered in printed circuit board (PCB) manufacturing. The goal is to maximize throughput of an automated PCB electroplating facility while ensuring feasibility with respect to process, capacity and material movement constraints. Building from a heuristic procedure generically referred to as PCP (precedence constraint posting), which relies on a temporal constraint graph representation of the problem, we straightforwardly define an extended solution procedure for minimizing makespan. In a series of comparative experiments, our procedure is found to significantly outperform previously published procedures for solving this hoist problem across a broad range of input assumptions.

[1]  Stephen F. Smith,et al.  Generating Feasible Schedules under Complex Metric Constraints , 1994, AAAI.

[2]  Ronald D. Armstrong,et al.  A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints , 1994 .

[3]  Lei Lei,et al.  The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints , 1991 .

[4]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[5]  Norman Sadeh,et al.  Look-ahead techniques for micro-opportunistic job shop scheduling , 1992 .

[6]  Henry A. Kautz,et al.  Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.

[7]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[8]  J. Erschler,et al.  Technical Note - Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem , 1976, Oper. Res..

[9]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[10]  Peter B. Ladkin,et al.  On binary constraint networks , 1989 .

[11]  Colin E. Bell.  Maintaining project networks in automated artificial intelligence planning , 1989 .

[12]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[13]  Stephen F. Smith,et al.  Applying constraint satisfaction techniques to job shop scheduling , 1997, Ann. Oper. Res..

[14]  Arne Thesen,et al.  SEMI-MARKOV DECISION MODELS FOR REAL-TIME SCHEDULING , 1991 .

[15]  Henry L. W. Nuttle,et al.  Hoist Scheduling For A PCB Electroplating Facility , 1988 .

[16]  J. Erschler,et al.  Characterizing the set of feasible sequences for n jobs to be carried out on a single machine , 1980 .

[17]  L. W. Phillips,et al.  Mathematical Programming Solution of a Hoist Scheduling Program , 1976 .

[18]  Nicola Muscettola,et al.  Scheduling by iterative partition of bottleneck conflicts , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.

[19]  Yuehwern Yih,et al.  ROBOT SCHEDULING IN A CIRCUIT BOARD PRODUCTION LINE:A HYBRID OR/ANN APPROACH , 1993 .

[20]  Itay Meiri,et al.  Combining Qualitative and Quantitative Constraints in Temporal Reasoning , 1991, Artif. Intell..

[21]  Yuehwern Yih,et al.  An algorithm for hoist scheduling problems , 1994 .

[22]  N. Hirabayashi,et al.  A decomposition scheduling method for operating flexible manufacturing systems , 1994 .

[23]  Stephen F. Smith,et al.  Slack-Based Heuristics for Constraint Satisfaction Scheduling , 1993, AAAI.