Authors:
Nhat-Vinh Vo
;
Pauline Fouillet
and
Christophe Lenté
Affiliation:
Université François-Rabelais de Tours, France
Keyword(s):
Scheduling, Flowshop, Total Completion Time, Lower Bound.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Operational Research
;
Pattern Recognition
;
Scheduling
;
Software Engineering
Abstract:
The flowshop scheduling problem has been largely studied for 60 years. As a criterion, the total completion time also receives a great amount of attention. Many studies have been carried out in the past but they are limited in the number of machines or constraints. MaxPlus algebra is also applied to the scheduling theory but the literature focuses on some concrete constraints. Therefore, this study presents a new method to tackle a general permutation flowshop problem, with additional constraints, to elaborate on lower bounds for the total completion time. These lower bounds can take into account several constraints, like delays, blocking or setup times, but they imply to solve a Traveling Salesman Problem. The theory is developed, based on a MaxPlus modeling of flowshop problems and experimental results are presented.