A job-shop problem with one additional resource type

We consider a job-shop scheduling problem with n jobs and the constraint that at most p<n jobs can be processed simultaneously. This model arises in several manufacturing processes, where each operation has to be assisted by one human operator and there are p (versatile) operators. The problem is binary NP-hard even with n=3 and p=2. When the number of jobs is fixed, we give a pseudopolynomial dynamic programming algorithm and a fully polynomial time approximation scheme (FPTAS). We also propose an enumeration scheme based on a generalized disjunctive graph, and a dynamic programming-based heuristic algorithm. The results of an extensive computational study for the case with n=3 and p=2 are presented.

[1]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[2]  P. Bruckner,et al.  An efficient algorithm for the job-shop problem with two jobs , 1988 .

[3]  Peter Brucker,et al.  Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems , 1996 .

[4]  Natalia V. Shakhlevich,et al.  NP-hardness of Shop-scheduling Problems with Three Jobs , 1995, Discret. Appl. Math..

[5]  Guoqing Wang,et al.  Complexity results for flow-shop problems with a single server , 2005, Eur. J. Oper. Res..

[6]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[7]  Joseph Y.-T. Leung,et al.  Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time , 1991, Inf. Comput..

[8]  Hans Kellerer,et al.  Scheduling parallel dedicated machines under a single non-shared resource , 2003, European Journal of Operational Research.

[9]  B. Roy,et al.  Les Problemes d'Ordonnancement , 1967 .

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

[11]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[12]  G. Schmidt.  Scheduling under resource constraints — Deterministic models , 1987 .

[13]  S. Akers.  Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .

[14]  Peter Brucker,et al.  An efficient algorithm for the job-shop problem with two jobs , 2005, Computing.

[15]  J. Carlier.  The one-machine sequencing problem , 1982 .

[16]  Jianer Chen,et al.  General Multiprocessor Task Scheduling , 1999 .

[17]  Chelliah Sriskandarajah,et al.  Minimizing Makespan in Flowshops with Pallet Requirements: Computational Complexity , 1997 .

[18]  Karl Ernst Osthaus.  Van de Velde , 1920 .

[19]  Celia A. Glass,et al.  Scheduling for Parallel Dedicated Machines with a Single Server , 2000 .

[20]  Han Hoogeveen,et al.  Minimizing makespan in a pallet-constrained flowshop , 1999 .

[21]  N. V. Shakhlevich,et al.  NP-hardness of shop-scheduling problems with three jobs , 1995 .

[22]  Gianpaolo Oriolo,et al.  The machine duplication problem in a job shop with two jobs , 1995 .

[23]  Chelliah Sriskandarajah,et al.  One-operator-two-machine flowshop scheduling with setup and dismounting times , 1999, Comput. Oper. Res..

[24]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[25]  Hans Kellerer,et al.  Scheduling problems for parallel dedicated machines under multiple resource constraints , 2003, Discret. Appl. Math..

[26]  Alessandro Agnetis,et al.  Scheduling three chains on two parallel machines , 2010, Eur. J. Oper. Res..

[27]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[28]  Raymond G. Vickson,et al.  One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective , 2004, Optim. Methods Softw..

[29]  Gary C. White,et al.  Chapter 1 – Preliminaries , 1990 .