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
Pre-Emptive Scheduling Problems with Controllable Processing Times
TL;DR: It is demonstrated that each single criterion problem can be formulated in terms of minimizing a linear function over a polymatroid, and this justifies the greedy approach to its solution.
Book ChapterDOI
Deep Reinforcement Learning as a Job Shop Scheduling Solver: A Literature Review
TL;DR: Complex optimization scheduling problems frequently arise in the manufacturing and transport industries, where the goal is to find a schedule that minimizes the total amount of time (or cost) required to complete all the tasks.
Journal ArticleDOI
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
TL;DR: This paper initiates research into scheduling with batching in the no-wait flowshop environment and gives NP -hardness proofs for three special cases, suggesting that it is very unlikely to devise an efficient method to find an optimal schedule for the problem under study.
Proceedings ArticleDOI
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives
TL;DR: The existence of schedules which simultaneously minimize two criteria is given and the existence of near-optimal schedules for both metrics are shown as well as some lower bound results.
Journal ArticleDOI
Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
TL;DR: A general precedence rule for the single-machine scheduling of jobs with uncertain processing times has been derived, essentially saying that “safe” jobs are to be scheduled before “unsafe’ jobs.