Issue |
RAIRO-Oper. Res.
Volume 37, Number 4, October-December 2003
ROADEF 2002
|
|
---|---|---|
Page(s) | 273 - 289 | |
DOI | https://doi.org/10.1051/ro:2004006 | |
Published online | 15 March 2004 |
Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan
Max-Plus generalization of Lageweg, Lenstra and Rinnooy Kan's lower bounds
Laboratoire d'Informatique de l'Université de Tours, Polytecth'Tours/DI.
Le traditionnel problème d'ordonnancement de type flowshop se généralise en un problème d'optimisation matricielle dans l'algèbre Max-Plus. Une famille de bornes inférieures est présentée pour ce nouveau problème et la preuve est apportée que ces bornes généralisent les bornes de Lageweg et al.
Abstract
The traditional flowshop scheduling problem can be generalised to a matricial optimisation problem in Max-Plus algebra. A family of lower bounds is developped for this new problem and proof is given that these bounds are a generalisation of the lower bounds of Lageweg et al.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.