Open Access
Sequencing and scheduling : algorithms and complexity
Eugene L. Lawler,Jan Karel Lenstra,Ahg Alexander Rinnooy Kan,David B. Shmoys +3 more
- Vol. 4, pp 445
Reads0
Chats0
TLDR
A survey of deterministic machine scheduling can be found in this article, where complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops are presented.Abstract:
Sequencing and scheduling as a research area is motivated by questions that arise in production planning, in computer control, and generally in all situations in which scarce resources have to be allocated to activities over time. In this survey, we concentrate on the area of deterministic machine scheduling. We review complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops. We also pay attention to two extensions of this area: resource-constrained project scheduling and stochastic machine scheduling.read more
Citations
More filters
Journal ArticleDOI
Two-stage no-wait scheduling models with setup and removal times separated
TL;DR: A complete complexity classification of the relevant two-stage no-wait scheduling models is provided, showing that, in general, the assembly problem is NP-hard in the strong sense.
Journal ArticleDOI
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
TL;DR: It is proved that the power of preemption is at least 4.5, and the first constant factor approximation algorithms for the preemptive and nonpreemptive cases are obtained, improving and extending a recent result by Leung et al.
Journal ArticleDOI
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
TL;DR: In this article, it was shown that the addressed scheduling problem is a special case of the vertex cover problem, which implies that previous results for the scheduling problem can be explained, and in some cases improved, by means of vertex cover theory.
Journal ArticleDOI
On scheduling an unbounded batch machine
TL;DR: It is proved that minimizing total tardiness is binary NP-hard, which has been an open problem in the literature and provides a nearly complete mapping of the complexity of scheduling an unbounded batch machine.
Journal ArticleDOI
A note: Common due date assignment for a single machine scheduling with the rate-modifying activity
TL;DR: This paper studies the single machine common due date assignment and scheduling problem with the possibility to perform a rate-modifying activity (RMA) for changing the processing times of the jobs following this activity.