Different behaviour of a double branch-and-bound algorithm on and problems

Companys, Ramón; Mateo, Manuel Otero

doi:10.1016/j.cor.2005.05.018

Cited by 39 publications

(27 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Interesting readers can find an exhaustive literature review in the books of Pinedo (2008), and Emmons and Vairaktarakis (2013). For the blocking constraint, few studies took into account the different criteria (Companys and Mateo, 2007;Ronconi, 2005;Moslehi and Khorasanian, 2013;Rippin, 1983;Dekhici and Belkadi, 2010). Other authors proposed an approximate methods (Ronconi, 2004;Armentano and Ronconi, 1999;Grabowski and Pempera, 2007;Wang et al, 2010;Companys et al, 2010;Chowdhury et al, 2013;Ribas et al, 2011).…”

Section: Introductionmentioning

confidence: 99%

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Toumi

Jarboui

Eddaly

et al. 2017

IJMOR

View full text Add to dashboard Cite

This paper deals with a permutation flowshop scheduling problem with blocking constraints. To minimise the makespan, it uses a branch-and-bound algorithm. A new lower bound is developed for the problem based upon the two machine-subproblem relaxation. Computational tests show the superiority of the proposed algorithm.Keywords: scheduling; blocking flowshop; lower bound; makespan.Reference to this paper should be made as follows: Toumi, S., Jarboui, B., Eddaly M. and Rebaï, A. (2017) 'Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion', Int.

show abstract

Section: Introductionmentioning

confidence: 99%

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Toumi

Jarboui

Eddaly

et al. 2017

IJMOR

View full text Add to dashboard Cite

show abstract

“…The auxiliary heuristics are built in two steps: in the first step, a permutation is obtained, and in the second step, a local search procedure is applied. Companys & Mateo (2005) concluded that the computational time required to solve Fm|block|Cmax problems is higher than for Fm|prmu|Cmax problems. Companys & Mateo (2005) also presented a Lompen algorithm, which runs two algorithms simultaneously of Branch and Bound.…”

Section: Introductionmentioning

confidence: 99%

“…Companys & Mateo (2005) concluded that the computational time required to solve Fm|block|Cmax problems is higher than for Fm|prmu|Cmax problems. Companys & Mateo (2005) also presented a Lompen algorithm, which runs two algorithms simultaneously of Branch and Bound. They solved eight problems unsolved by other methods.…”

Section: Introductionmentioning

confidence: 99%

“…During the past 40 years, the scheduling problem with the objective of minimizing the makespan in flowshop environment with blocking constraint has been studied by many researchers such as Companys & Mateo (2005); Ronconi (2005); Ronconi & Armentano (2001). This problem, which is described as Fm|block|Cmax according to Pinedo (2008), consists of scheduling n jobs that must be processed by m machines always with the same flow.…”

Section: Introductionmentioning

confidence: 99%

“…The results showed that although the MM heuristic achieved good results, it was outperformed by the PF heuristic, which showed potential for major problems. Companys & Mateo (2005) proposed an improved Branch and Bound algorithm to solve these problems and auxiliary heuristics to get a good initial solution in Fm|prmu|Cmax and Fm|block|Cmax problems, in which, prmu refers to the permutational environment. The auxiliary heuristics are built in two steps: in the first step, a permutation is obtained, and in the second step, a local search procedure is applied.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

<b>Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking

2016

View full text Add to dashboard Cite

ABSTRACT. This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be NP-Hard, the branch and bound algorithm may take long computational time to find the best solution. The use of an initial solution may reduce the computational time, by providing an initial upper bound. In this work, the efficiency of the use of an initial solution to the Branch and Bound algorithm was evaluated by comparison of the algorithms. The branch and bound algorithm used, as well as the lower bound, was proposed by Ronconi (2005). Four heuristic methods (MM, PF, wPF, and PW) were tested using a 180 problems data. Results show that the use of an initial solution does considerably reduce the computational time.Keywords: Branch and Bound, heuristics, flowshop, block, makespan, scheduling.Avaliação de heurísticas para um algoritmo branch e bound para minimizar o makespan em um flowshop com bloqueio RESUMO. Este trabalho tem o objetivo de avaliar o uso de diferentes métodos heurísticos para obtenção de uma solução inicial para um algoritmo branch e bound, tendo como objetivo minimizar o makespan em um ambiente flowshop com buffer zero. Como o problema é conhecido por ser NP-Hard, o algoritmo branch e bound pode necessitar de elevado tempo computacional para encontrar a melhor solução. A utilização de uma solução inicial pode reduzir o tempo de processamento, proporcionando um limite superior inicial. Neste trabalho, a eficiência da utilização de uma solução inicial para o algoritmo branch e bound foi avaliada com a comparação dos algoritmos. O algoritmo branch e bound utilizado, bem como o limitante inferior foram propostos por Ronconi (2005). Cinco métodos heurísticos foram avaliados (MM, PF, wPF e PW) utilizando um conjunto de problemas teste composto de 180 problemas. Os resultados mostraram que a utilização da heurística para obter uma solução inicial para o algoritmo branch e bound reduz significativamente o tempo computacional.Palavras-chave: Branch e Bound, heurísticas, flowshop, bloqueio, makespan, programação.

show abstract

An Estimation of Distribution Algorithm for Minimizing the Makespan in Blocking Flowshop Scheduling Problems

Jarboui¹,

Eddaly²,

Siarry

et al. 2009

Computational Intelligence in Flow Shop and Job Shop Scheduling

View full text Add to dashboard Cite

Different behaviour of a double branch-and-bound algorithm on and problems

Cited by 39 publications

References 32 publications

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

<b>Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking

An Estimation of Distribution Algorithm for Minimizing the Makespan in Blocking Flowshop Scheduling Problems

Contact Info

Product

Resources

About