Sign in
Back
New lower bounds for the blocking flowshop scheduling problem to minimize the total completion time criterion
Conference proceeding

New lower bounds for the blocking flowshop scheduling problem to minimize the total completion time criterion

Said Toumi, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebai and IEEE
2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), pp.1-5
International Conference on Modeling Simulation and Applied Optimization
01/01/2013
DOI: https://doi.org/10.1109/ICMSAO.2013.6552573

Abstract

Computer Science Computer Science, Information Systems Computer Science, Interdisciplinary Applications Engineering Engineering, Electrical & Electronic Science & Technology Technology
The paper presents an exact approach for a permutation flowshop scheduling problem with blocking constraint. The objective is to minimize the total completion time of jobs. The solution method is a branch and bound procedure where lower bounds based on problem characteristics are derived. Whithin an experimental performance analysis, this approach is evaluated.

Metrics

1 Record Views

Details