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
An adaptive branching rule for the permutation flow-shop problem : (preprint)
TL;DR: A branch-and-bound algorithm is presented for the permutation flow-shop problem in which the objective is to minimise the maximum completion time and computational results indicate that the proposed algorithm is superior to previously published algorithms.
Book ChapterDOI
Industrial Context and Motivation of Decomposition Methods
Irfan M. Ovacik,Reha Uzsoy +1 more
TL;DR: This chapter describes the industrial environment, formulate a job shop scheduling problem, discuss the limitations of this formulation and relate it to existing literature, and describes the decomposition approach that is suggested and motivate its use in this environment.
Posted Content
Complexity of scheduling jobs on parallel machines under precedence constraints: a survey
TL;DR: This survey demonstrates that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems and shows that many problems can be NP-hard when considering general precedence constraints, while they become polynomially solvable for particular precedence constraints.
A planning board generator. Part I: Problem instances and types
M Wennink,Mwp Martin Savelsbergh +1 more
TL;DR: The view of a planning board generator is discussed and a method to describe problem instances and types is introduced and introduced to facilitate the development of planning boards is introduced.