Scheduling for Parallel Dedicated Machines with a Single Server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule isNP-hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP-hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore{Gomory traveling salesman problem and solve it in polynomial time. c 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304{328, 2000

[1]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[2]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[3]  K. R Baker,et al.  Scheduling groups of jobs in the two-machine flow shop , 1990 .

[4]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

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

[6]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

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

[8]  Jatinder N. D. Gupta,et al.  Two-stage no-wait scheduling models with setup and removal times separated , 1997, Comput. Oper. Res..

[9]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[10]  Jacek Blazewicz,et al.  Scheduling of client-server applications , 1999 .

[11]  E. Lawler,et al.  Well-solved special cases , 1985 .

[12]  Katsundo Hitomi,et al.  Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .

[13]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[14]  Chelliah Sriskandarajah,et al.  Parallel machine scheduling with a common server , 2000, Discret. Appl. Math..

[15]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[16]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[17]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[18]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[19]  Vitaly A. Strusevich,et al.  Two machine open shop scheduling problem with setup, processing and removal times separated , 1993, Comput. Oper. Res..

[20]  W. Kubiak,et al.  A Note On The Complexity Of Openshop Scheduling Problems , 1991 .

[21]  C. Sriskandarajah,et al.  Two-machine group scheduling problem with blocking and anticipatory setups , 1993 .