Concurrent open shop scheduling to minimize the weighted number of tardy jobs
Journal of Scheduling
Scheduling Parallel Machines for the Customer Order Problem
Journal of Scheduling
Order Scheduling in an Environment with Dedicated Resources in Parallel
Journal of Scheduling
The complexity of customer order scheduling problems on parallel machines
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Scheduling orders for multiple product types to minimize total weighted completion time
Discrete Applied Mathematics
Distributed order scheduling and its application to multi-core dram controllers
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Order scheduling models: hardness and algorithms
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Solving two-machine assembly scheduling problems with inventory constraints
Computers and Industrial Engineering
Minimizing the sum of weighted completion times in a concurrent open shop
Operations Research Letters
Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
Theoretical Computer Science
| Hi-index | 0.00 |
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.