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
Book ChapterDOI
Forward Backward Transformation
TL;DR: In this paper, an Enhanced Differential Evolution (EDEDE) algorithm is proposed to solve permutative combinatorial optimization problems, such as Flow shop scheduling, quadratic assignment and traveling salesman.
Journal ArticleDOI
A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
TL;DR: A penalty-based heuristic algorithm is developed to find an approximately minimum makespan schedule by determining the penalty in time associated with a particular sequence and selecting the sequence with the minimum time penalty as the best heuristic solution.
Journal ArticleDOI
Flow shop and open shop scheduling with a critical machine and two operations per job
TL;DR: This paper develops polynomial time algorithms to solve the m machine flow shop and open shop makespan problems with a critical machine and at most two operations per job under certain assumptions.
Journal ArticleDOI
An investigation on single machine total weighted tardiness scheduling problems
R. Maheswaran,S. G. Ponnambalam +1 more
TL;DR: An investigation on the total weighted tardiness of the single machine scheduling problems by a heuristic procedure, namely backward forward heuristics.
Journal ArticleDOI
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
TL;DR: This work investigates the approximability of a no-wait permutation flow shop scheduling problem under the makespan criterion and presents a polynomial time approximation scheme (PTAS) for the problem on any fixed number of machines.