Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Authors:
Wenci Yu;Han Hoogeveen;Jan Karel Lenstra
Affiliations:
Applied Mathematics Institute, East China University of Science and Technology, Shanghai 200237, China;Department of Computer Science, Utrecht University, P.O. Box 80089, 3508 TB Utrecht, The Netherlands. slam@cs.uu.nl;CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands
Venue:
Journal of Scheduling
Year:
2004

Citing 2
Cited 25

On the complexity of coupled-task scheduling

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Minimizing mean flowtime and makespan on master--slave systems

Journal of Parallel and Distributed Computing
Permutation flowshop scheduling problems with maximal and minimal time lags

Computers and Operations Research
Polynomial time algorithms for the UET permutation flowshop problem with time delays

Computers and Operations Research
Analysis of heuristics for the UET two-machine flow shop problem with time delays

Computers and Operations Research
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Minimizing total completion time in two-machine flow shops with exact delays

Computers and Operations Research
Mapping filtering streaming applications with communication costs

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Permutation flowshop scheduling problems with maximal and minimal time lags

Computers and Operations Research
Note: A note on the hardness of Skolem-type sequences

Discrete Applied Mathematics
A 3/2-approximation for the proportionate two-machine flow shop scheduling with minimum delays

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On-line two-machine job shop scheduling with time lags

Information Processing Letters
Polynomial-time approximation schemes for scheduling problems with time lags

Journal of Scheduling
The focus of attention problem

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Transporting jobs through a processing center with two parallel machines

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Coupled-task scheduling on a single machine subject to a fixed-job-sequence

Computers and Industrial Engineering
Approximation algorithms for scheduling problems with exact delays

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A parallel distributed algorithm for the permutation flow shop scheduling problem

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Unweighted coalitional manipulation under the Borda rule Is NP-hard

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Approximation algorithms for UET scheduling problems with exact delays

Operations Research Letters
Profit-based latency problems on the line

Operations Research Letters
Improved analysis of an algorithm for the coupled task problem with UET jobs

Operations Research Letters
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard

Operations Research Letters
Scheduling coupled-operation jobs with exact time-lags

Discrete Applied Mathematics
Preemptive scheduling on two identical parallel machines with a single transporter

Journal of Combinatorial Optimization
Efficient scheduling to minimize calibrations

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the first problems to be studied in scheduling theory was the problem of minimizing the makespan in a two-machine flow shop. Johnson showed that this problem can be solved in O(n log n) time. A crucial assumption here is that the time needed to move a job from the first to the second machine is negligible. If this is not the case and if this ‘delay’ is not equal for all jobs, then the problem becomes NP-hard in the strong sense. We show that this is even the case if all processing times are equal to one. As a consequence, we show strong NP-hardness of a number of similar problems, including a severely restricted version of the Numerical 3-Dimensional Matching problem.