Sign in
Back
Lower bounds on the total tardiness and total weighted tardiness for scheduling flowshop with blocking
Conference proceeding

Lower bounds on the total tardiness and total weighted tardiness for scheduling flowshop with blocking

Said Toumi, Bassem Jarboui, Mansour Eddaly and Abdelwaheb Rebai
2013 International Conference on Advanced Logistics and Transport, pp.296-301
05/2013
DOI: https://doi.org/10.1109/ICAdLT.2013.6568475

Abstract

Approximation algorithms Complexity theory Economics Electronic mail Processor scheduling Schedules Scheduling
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 literature.

Metrics

1 Record Views

Details