Sign in
Back
Branch and bound algorithm for solving blocking flowshop scheduling problem with total completion time
Conference proceeding

Branch and bound algorithm for solving blocking flowshop scheduling problem with total completion time

Said Toumi, Bassem Jarboui, Mansour Eddaly and Abdelwaheb Rebai
2013 International Conference on Control, Decision and Information Technologies (CoDIT), pp.746-749
05/2013
DOI: https://doi.org/10.1109/CoDIT.2013.6689635

Abstract

Economics Electronic mail Job shop scheduling Linear programming Routing Search problems
This paper addresses to the scheduling of a permutation flowshop scheduling problem with blocking constraints to minimize the total completion time with a branch and bound algorithm. New machine based lower bound was developed for the problem. The experimental results on this criterion have shown the efficiency of the proposed algorithm both in terms of solutions quality and time requirements.

Metrics

1 Record Views

Details