This paper proposes new machine based lower bounds for scheduling the flowshop with blocking constraints problem while minimizing the total tardiness and total weighted tardiness. Some characteristics of the developed branch and bound algorithm are discussed and computational experiments on several random instances are presented. The obtained results compare favorably with previous works in the litterature.
Lower bounds on the total tardiness and total weighted tardiness for scheduling flowshop with blocking
2013-05-01
922689 byte
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 2012
|British Library Online Contents | 2016
|Scheduling with earliness and tardiness penalties
TIBKAT | 1990
|NEH-based heuristics for the distributed permutation flowshop with rejection and tardiness
British Library Conference Proceedings | 2023
|Minimizing Total Tardiness on Parallel Machines Based on Genetic Algorithms
British Library Online Contents | 2003
|