Journal
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Volume 37, Issue 3, Pages 734-739Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2008.05.002
Keywords
Flow shop scheduling; Total flow time; Heuristic procedure
Ask authors/readers for more resources
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;3 1:31 1-7] for this problem. We show, through computational experimentation, that this modification significantly improves its performance while not affecting its time-complexity. (c) 2008 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available