Non-approximability of precedence-constrained sequencing to minimize setups

Authors:
Craig A. Tovey
Affiliations:
School of ISyE and College of Computing, Georgia Tech. Atlanta, GA
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 3
Cited 1

A simplified anomaly and reduction for precedence constrained multiprocessor scheduling

SIAM Journal on Discrete Mathematics
Routing printed circuit cards through an assembly cell

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

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

Communication: A note on the precedence-constrained class sequencing problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

It is a basic scheduling problem to sequence a set of precedence-constrained tasks to minimize the number of setups, where the tasks are partitioned into classes that require the same setup. We prove a conjecture in (Ph.D. Thesis, School of ISyE, Georgia Institute of Technology, August 1986; Oper. Res. 39 (1991) 1012) that no polynomial-time algorithm for this problem has constant worst-case performance ratio unless P = NP. A very simple algorithm has performance ratio √n.