Job Shop Scheduling

The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore, the tasks in each job are subject to precedence constraints. A schedule is, then, an arrangement of all tasks on the machines that satisfies the precedence constraints. Usually the number of constraints is very large, which makes JSP one of the hardest combinatorial problems (an NP-complete problems, [99] and [57]. The flow shop problem (FSP), a much restricted version of JSP, can be reduced to the traveling salesman problem (TSP) [137].

[1]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[4]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

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

[6]  Fahiem Bacchus,et al.  Dynamic Variable Ordering in CSPs , 1995, CP.

[7]  JRmes M. Crawford.  An Approach to Resource Constrained Project Scheduling , 1996 .

[8]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[9]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[10]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[11]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[12]  E. Balas.  On the facial structure of scheduling polyhedra , 1985 .

[13]  David Y. Y. Yun,et al.  A Planning/Scheduling Methodology for the Constrained Resource Problem , 1989, IJCAI.

[14]  Peter van Beek,et al.  A Theoretical Evaluation of Selected Backtracking Algorithms , 1995, IJCAI.

[15]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[16]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[17]  Subbarao Kambhampati,et al.  Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..

[18]  Norman M. Sadeh,et al.  Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem , 1995, Artif. Intell..