Abstract
In no-wait flow shop production, each job must be processed without any interruption from its start time on the first machine to its completion time on the last machine. To minimize makespan in no-wait flow shop production is one of the main concerns in industry. In this paper, we propose an average departure time (ADT) heuristic for minimizing makespan in no-wait flow shop production. Based on the computational experiment with a large number of instances of various sizes, the ADT heuristic performs better than three existing best-known heuristics in the same computational complexity environment.
| Original language | English |
|---|---|
| Pages (from-to) | 2-7 |
| Number of pages | 6 |
| Journal | Journal of Manufacturing Systems |
| Volume | 40 |
| DOIs | |
| State | Published - Jul 1 2016 |
Bibliographical note
Publisher Copyright:© 2016 The Society of Manufacturing Engineers
Keywords
- Computational complexity
- Heuristics
- Makespan minimization
- No-wait flow shop
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Hardware and Architecture
- Industrial and Manufacturing Engineering