A heuristic to minimize total flow time in permutation flow shop
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.
Year of publication: |
2009
|
---|---|
Authors: | Laha, Dipak ; Sarin, Subhash C. |
Published in: |
Omega. - Elsevier, ISSN 0305-0483. - Vol. 37.2009, 3, p. 734-739
|
Publisher: |
Elsevier |
Keywords: | Flow shop scheduling Total flow time Heuristic procedure |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A heuristic to minimize total flow time in permutation flow shop
Laha, Dipak, (2009)
-
A heuristic to minimize total flow time in permutation flow shop
Laha, Dipak, (2009)
-
A heuristic to minimize total flow time in permutation flow shop
Laha, Dipak, (2009)
- More ...