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
A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
TL;DR: A genetic algorithm based on random-keys encoding is proposed to solve the problem of minimizing makespan on unrelated parallel BPMs with non-identical job sizes and arbitrary release times.
Journal ArticleDOI
A Survey of Solving Approaches for Multiple Objective Flexible Job Shop Scheduling Problems
TL;DR: The purpose of this paper is to provide a review of the techniques, developed to solve multiple objective FJSSPs during the last decade: approaches with application of mathematical models and heuristic approaches.
Proceedings ArticleDOI
Acyclic) Job Shops are Hard to Approximate
Monaldo Mastrolilli,Ola Svensson +1 more
TL;DR: The results show that the restrictions on the number of machines and operations per job are necessary to obtain a PTAS, and provide an inapproximability result whose value grows with mu to infinity.
Journal ArticleDOI
Penalty cost constrained identical parallel machine scheduling problem
TL;DR: The result is fairly good in the sense that in a reasonable size of jobs, the FPTAS improves previous best running time from O ( n m + 2 / � m ) to O ( 1 / � 2 m + 3 + mn 2 ) .
Journal ArticleDOI
Efficient approximation algorithms for the routing open shop problem
TL;DR: This work considers the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the metric traveling salesman problem, and presents new polynomial-time approximation algorithms with worst-case performance guarantees.