Using Max-Plus algebra to generalise some lower bounds on flowshop scheduling

Using Max-Plus algebra to generalise some lower bounds on flowshop scheduling

0.00 Avg rating0 Votes
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: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.