Article ID: | iaor20052767 |
Country: | France |
Volume: | 37 |
Issue: | 4 |
Start Page Number: | 273 |
End Page Number: | 289 |
Publication Date: | Oct 2003 |
Journal: | RAIRO Operations Research |
Authors: | Lent Christophe, Bouquard Jean-Louis |
The traditional flowshop scheduling problem can be generalised to a matricial optimisation problem in Max-Plus algebra. A family of lower bounds is developed for this new problem and proof is given that these bounds are a generalisation of the lower bounds of Lageweg et al.