Showing 1 - 8 of 8
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...
Persistent link: https://www.econbiz.de/10005358382
In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CON\VIP production control system with the objective to minimise the make span We characterise the problem and analyse its similarities and differences with the permutation flow-shop problem A comparison of...
Persistent link: https://www.econbiz.de/10009283676
Persistent link: https://www.econbiz.de/10005278160
Persistent link: https://www.econbiz.de/10005240723
Persistent link: https://www.econbiz.de/10005257149
Persistent link: https://www.econbiz.de/10005188796
Persistent link: https://www.econbiz.de/10005188839
Persistent link: https://www.econbiz.de/10005371820