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
Scheduling flow shops using differential evolution algorithm
TL;DR: The novel method requires few control variables, is relatively easy to implement and use, effective, and efficient, which makes it an attractive and widely applicable approach for solving practical engineering problems.
Proceedings ArticleDOI
A PTAS for the multiple knapsack problem
Chandra Chekuri,Sanjeev Khanna +1 more
TL;DR: The main result of this paper is a polynomial time approximation scheme for MKP, which helps demarcate the boundary at which instances of GAP become APX-hard.
Journal ArticleDOI
Flowshop scheduling research after five decades
TL;DR: A brief glimpse into the evolution of flowshop scheduling problems and possible approaches for their solution over the last fifty years is provided.
Journal ArticleDOI
Mathematical models for job-shop scheduling problems with routing and process plan flexibility
TL;DR: In this paper, a mixed-integer linear programming model (MILP-1) is developed for FJSPs and compared to an alternative model in the literature (Model F) in terms of computational efficiency.