Solving blocking flowshop scheduling problem with branch and bound algorithm

Said Toumi; Bassem Jarboui; Mansour Eddaly; Abdelwaheb Rebai

doi:10.1109/ICAdLT.2013.6568494

Back

Conference proceeding

Solving blocking flowshop scheduling problem with branch and bound algorithm

Said Toumi, Bassem Jarboui, Mansour Eddaly and Abdelwaheb Rebai

2013 International Conference on Advanced Logistics and Transport, pp.411-416

05/2013

DOI: https://doi.org/10.1109/ICAdLT.2013.6568494

Abstract

Economics

Electronic mail

Job shop scheduling

Linear programming

Processor scheduling

Schedules

In this paper a branch and bound algorithm is presented for solving blocking flowshop scheduling problem. We consider the total completion time and total weighted completion time as objective function. Our proposed algorithm is the first one that addressed to these criteria. Besides, new machine based lower bounds are derived. Computational experiments show the effectiveness of the branch and bound algorithm to solve large scale instances.

Metrics

1 Record Views

Details

Title: Solving blocking flowshop scheduling problem with branch and bound algorithm
Creators - without role: Said Toumi - University of Sfax
Bassem Jarboui - University of Sfax
Mansour Eddaly - University of Sfax
Abdelwaheb Rebai - University of Sfax
Publication Details: 2013 International Conference on Advanced Logistics and Transport, pp.411-416
Publisher: IEEE
Identifiers: 9918791708331
Academic Unit: Majmaah University; Qassim University
Language: English
Resource Type: Conference proceeding