Sign in
Back
An efficient branch and bound algorithm to solve the permutation flowshop scheduling problem with blocking constraints
Conference proceeding

An efficient branch and bound algorithm to solve the permutation flowshop scheduling problem with blocking constraints

Said Toumi, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebai and IEEE
2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), pp.1-6
04/2013
DOI: https://doi.org/10.1109/ICMSAO.2013.6552616

Abstract

Approximation algorithms Economics Electronic mail Equations Face Heuristic algorithms Scheduling
We consider the m machine blocking flowshop scheduling problem. The objective is to obtain a feasible solution that minimizes the total tardiness criterion. We derive new machine based lower bound for this problem. Favorable experimental results are reported on an extensive set of problem instances.

Metrics

1 Record Views

Details