A heuristic to minimize total flow time in permutation flow shop |
| |
Authors: | Dipak Laha Subhash C. Sarin |
| |
Affiliation: | 1. Department of Mechanical Engineering, Jadavpur University, Kolkata 700032, India;2. Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA 24061, USA |
| |
Abstract: | In this paper, we address an n-job, m-machine permutation flow shop scheduling problem for the objective of minimizing the total flow time. We propose a modification of the best-known method of Framinan and Leisten [An efficient constructive heuristic for flowtime minimization in permutation flow shops. Omega 2003;31:311–7] for this problem. We show, through computational experimentation, that this modification significantly improves its performance while not affecting its time-complexity. |
| |
Keywords: | Flow shop scheduling Total flow time Heuristic procedure |
本文献已被 ScienceDirect 等数据库收录! |
|