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

Full description

Saved in:
Bibliographic Details
Main Authors: Toumi, Said, Jarboui, Bassem, Eddaly, Mansour, Rebai, Abdelwaheb
Format: Conference Proceeding
Language:English
Subjects:
Approximation algorithms
Complexity theory
Economics
Electronic mail
Processor scheduling
Schedules
Scheduling
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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