Open Access
Sequencing and scheduling: algorithms and complexity
Eugene L. Lawler,Jan Karel Lenstra,A. H. G. Rinnooy Kan,David B. Shmoys +3 more
- Vol. 8909, pp 445-522
TLDR
This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.About:
The article was published on 1989-01-01 and is currently open access. It has received 1401 citations till now. The article focuses on the topics: Fair-share scheduling & Dynamic priority scheduling.read more
Citations
More filters
Journal ArticleDOI
A review of scheduling research involving setup considerations
TL;DR: A comprehensive review of the literature on scheduling problems involving setup times (costs) classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops.
Journal ArticleDOI
An approximation algorithm for the generalized assignment problem
David B. Shmoys,Éva Tardos +1 more
TL;DR: The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs; each job is to be processed by exactly one machine; processing jobj on machinei requires timepij and incurs a cost ofcij; each machinei is available forTi time units, and the objective is to minimize the total cost incurred.
Journal ArticleDOI
Deterministic job-shop scheduling: Past, present and future
Anant Singh Jain,Sheik Meeran +1 more
TL;DR: A subclass of the deterministic job-shop scheduling problem in which the objective is minimising makespan is sought, by providing an overview of the history, the techniques used and the researchers involved.
Journal ArticleDOI
A concise survey of scheduling with time-dependent processing times
TL;DR: A framework is provided to illustrate how models for this class of machine scheduling problems have been generalized from the classical scheduling theory, and a complexity boundary is presented for each model.
Journal ArticleDOI
Algorithms for scheduling imprecise computations
TL;DR: A queuing-theoretical formulation of the imprecise scheduling problem is presented and workload models that quantify the tradeoff between result quality and computation time are reviewed.
References
More filters
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Journal ArticleDOI
Optimal two- and three-stage production schedules with setup times included
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
Journal ArticleDOI
The Complexity of Flowshop and Jobshop Scheduling
TL;DR: The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.