Sequencing and scheduling : algorithms and complexity
1993; Elsevier BV; Volume: 4; Linguagem: Inglês
ISSN
2212-1323
AutoresEL Lawler, JK Jan Karel Lenstra, Ahg Alexander Rinnooy Kan, DB David Shmoys,
Tópico(s)Resource-Constrained Project Scheduling
ResumoSequencing 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.
Referência(s)