Minimising maximum lateness in a two-machine flowshop |
| |
Authors: | M Haouari T Ladhari |
| |
Institution: | 1.Ecole Polytechnique de Tunisie, La Marsa,;2.Institut Supérieur de Gestion de Tunis, Le Bardo,Tunisia |
| |
Abstract: | The objective of this paper is to develop a branch and bound algorithm for the problem of minimising maximum lateness in a two-machine flowshop, subject to release dates and time lag constraints. The importance of this NP-hard problem is twofold, it arises as a strong relaxation of the classical permutation flowshop problem, and it generalises several well studied two-machine flowshop problems. Computational experiments performed on a large set of randomly generated problems show that our algorithm can solve to optimality large size instances. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|