论文信息 - Branch and bound algorithm for solving blocking flowshop scheduling problem with total completion time

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

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.

Abdelwaheb Rebai | Bassem Jarboui | Mansour Eddaly | Said Toumi

[1] Débora P. Ronconi,et al. A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[2] R. Ahmadi,et al. Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop , 1990 .

[3] Mehmet Fatih Tasgetiren,et al. Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

[4] S. Bansal. Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .

[5] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[6] Débora P. Ronconi,et al. Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..

[7] Chandrasekharan Rajendran,et al. Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs , 2009, J. Oper. Res. Soc..

[8] Ömer Kirca,et al. A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems , 2002 .