A note on the complexity of the concurrent open shop problem

The concurrent open shop problem is a relaxation of the well known open job shop problem, where the components of a job can be processed in parallel by dedicated, component specific machines. Recently, the problem has attracted the attention of a number of researchers. In particular, Leung et al. (2005) show, contrary to the assertion in Wagneur and Sriskandarajah (1993), that the problem of minimizing the average job completion time is not necessarily strongly NP-hard. Their finding has thus once again opened up the question of the problem's complexity. This paper re-establishes that, even for two machines, the problem is NP-hard in the strong sense.

[1]  T. C. Edwin Cheng,et al.  Customer order scheduling to minimize total weighted completion time , 2007 .

[2]  Uttarayan Bagchi,et al.  Coordinated Scheduling of Customer Orders , 2001 .

[3]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[4]  T. A. Roemer,et al.  The Complexity of Scheduling Customer Orders , 2001 .

[5]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[6]  Zhi-Long Chen,et al.  SUPPLY CHAIN SCHEDULING: ASSEMBLY SYSTEMS , 2000 .

[7]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[8]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[9]  T. C. Edwin Cheng,et al.  Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs , 2003, J. Sched..

[10]  Uttarayan Bagchi,et al.  Coordinated scheduling of customer orders for quick response , 2005 .

[11]  Chelliah Sriskandarajah,et al.  Openshops with Jobs Overlap , 1993 .

[12]  Joseph Y.-T. Leung,et al.  Scheduling orders for multiple product types to minimize total weighted completion time , 2007, Discret. Appl. Math..

[13]  Joseph Y.-T. Leung,et al.  Order Scheduling Models: An Overview , 2005 .

[14]  Joseph Y.-T. Leung,et al.  Order Scheduling in an Environment with Dedicated Resources in Parallel , 2005, J. Sched..

[15]  Marc E. Posner,et al.  Scheduling Parallel Machines for the Customer Order Problem , 2003, J. Sched..

[16]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[17]  Chang Sup Sung,et al.  Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines , 1998 .

[18]  Chelliah Sriskandarajah,et al.  Open shops with jobs overlap - revisited , 2005, Eur. J. Oper. Res..

[19]  Jaehwan Yang,et al.  The complexity of customer order scheduling problems on parallel machines , 2005, Comput. Oper. Res..

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