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
Integration of order picking and vehicle routing in a B2C e-commerce context
TL;DR: In this paper, an order picking problem and a vehicle routing problem with time windows and release dates are solved simultaneously using a single optimization framework, which can lead to cost savings of 14% on average.
Journal ArticleDOI
New trends in parallel machine scheduling
Kokin Lam,Wenxun Xing +1 more
TL;DR: Some new trends in parallel machine scheduling (PMS) are reviewed, including non‐regular objectives oriented by the JIT concept; pre‐emption with set‐up; capacitated machine scheduling; and relationships between PMS and vehicle routeing problems.
Journal ArticleDOI
Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
Valery Gordon,Wieslaw Kubiak +1 more
TL;DR: The problem of scheduling n jobs with unequal, in general, processing times and total processing time equal to n on a single machine to minimize the weighted number of late jobs is considered and is shown to be NP-hard in the strong sense in the nonpreemptive case, and solvable in O(n) time in the preemptive case.
Book ChapterDOI
Sequential and parallel local search algorithms for job shop scheduling
TL;DR: In this article, a fast sequential tabu search algorithm for the job shop scheduling problem is described, which uses an efficient way to recompute the path lengths in the graph representation after a step to a neighbouring solution.
Journal ArticleDOI
Batching decisions for assembly production systems
TL;DR: This work provides a fairly comprehensive complexity classification of the problems under the first type of batching, and presents a heuristic and its worst-case analysis under the second type ofbatching.