New directions in scheduling theory

Authors:
J. K. Lenstra;A. H. G. Rinnooy Kan
Affiliations:
Centre for Mathematics and Computer Science, Amsterdam, The Netherlands;Erasmus University, Rotterdam, The Netherlands
Venue:
Operations Research Letters
Year:
1984

Citing 4
Cited 0

Preemptive Scheduling with Release Times, Deadlines, and Due Times

Journal of the ACM (JACM)
Computer-Aided complexity classification of combinational problems

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
A linear-time algorithm for a special case of disjoint set union

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is an assessment of new developments in the theory of sequencing and scheduling. After a review of recent results and open questions within the traditional class of scheduling problems, we focus on the probabilistic analysis of scheduling algorithms and next discuss some extensions of the traditional problem class that seem to be of particular interest.