Framinan, J. M.; Leisten, R. - In: Omega 31 (2003) 4, pp. 311-317
In this paper, we propose a heuristic for mean/total flowtime minimisation in permutation flow shops. The heuristic exploits the idea of 'optimising' partial schedules, already present in the NEH-heuristic (Omega 11 (1983) 91) with respect to makespan minimisation. We compare the proposed...