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

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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Toumi, Said, Jarboui, Bassem, Eddaly, Mansour, Rebai, Abdelwaheb
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Approximation algorithms
Complexity theory
Economics
Electronic mail
Processor scheduling
Schedules
Scheduling
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/ICAdLT.2013.6568475