Abstract
No-wait flow shop production has been widely applied in manufacturing, where no waiting time is allowed between intermediate operations. However, minimization of makespan for no-wait flow shop production is NP-hard. In this paper, we propose an average idle time (AIT) heuristic to minimize makespan in no-wait flow shop production. First, we take the current idle times and future idle times into consideration, proposing an initial sequence algorithm, and then use the insertion and neighborhood exchanging methods to further improve solutions. Compared with three existing best-known heuristics, our AIT heuristic can achieve the smallest deviations of 0.23% from optimum, based on Taillard's benchmarks and 600 randomly generated instances, in the same computational complexity.
| Original language | English |
|---|---|
| Pages (from-to) | 273-279 |
| Number of pages | 7 |
| Journal | Journal of Manufacturing Systems |
| Volume | 44 |
| DOIs | |
| State | Published - Jul 2017 |
Keywords
- Computational complexity
- Heuristics
- Makespan
- No-wait flow shop
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Hardware and Architecture
- Industrial and Manufacturing Engineering