Laha, Dipak; Sarin, Subhash C. - In: Omega 37 (2009) 3, pp. 734-739
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...