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
Online over time processing of combinatorial problems
TL;DR: This work formalize and present an online over time problem where arriving instances are subject to waiting time constraints, and proposes computational approaches that combine the use of machine learning, MIP, and instance interruption heuristics to maximize the number of solved instances.
Journal ArticleDOI
Minimizing maximum lateness in a flow shop subject to release dates
TL;DR: The proposed branch-and-bound algorithm encompasses several features including a procedure for adjusting heads and tails, heuristics, and a lower bounding procedure, which is based on the exact solution of the two-machine flow shop problem with time lags, ready times, and delivery times.
Journal ArticleDOI
Evaluation on GA based Model for solving JSSP
A. Tamilarasi,S. Jayasankari +1 more
TL;DR: The arrived results proved that the conventional way of randomly selecting initial conditions of the evolutionary process has a worst effect on performance in JSSP of higher dimensions.
Book ChapterDOI
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling
Klaus Jansen,Lorant Porkolab +1 more
TL;DR: These results include (as special cases) many recent developments on polynomial time approximation schemes for scheduling jobs on unrelated machines, multiprocessor tasks, and classical open, flow and job shops.
Shop Problems with two Machines and Time Lags
TL;DR: A Tabu Search algorithm is defined and the effectiveness of the proposed bounds is proved through extensive computational results.