Optimizing blocking flow shop scheduling problem with total completion time criterion

Moslehi, Ghasem; Khorasanian, Danial

doi:10.1016/j.cor.2013.02.003

Cited by 40 publications

(7 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…− Heuristic MME-B: Han et al (2013) (adapted from Han et al, 2012 for Fm | block | C max ). − Heuristic NEH-MK: Moslehi and Khorasanian (2013) . − Heuristic PF: (adapted from Ronconi, 2004 for Fm | block | C max ).…”

Section: Implemented Heuristicsmentioning

confidence: 99%

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

Fernández-Viagas

Leisten

2016

Expert Systems with Applications

View full text Add to dashboard Cite

Section: Implemented Heuristicsmentioning

confidence: 99%

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

Fernández-Viagas

Leisten

2016

Expert Systems with Applications

View full text Add to dashboard Cite

“…For example, Kilincci et al [7] investigated a fuzzy analytic hierarchy (FAHP) process-based methodology to select the best supplier firm; Wang et al [8] presented a multicriteria decision-making method based on multiobjective linear programming and fuzzy logic. In the job shop scheduling, Moslehi et al [9] developed a branch and bound algorithm for solving the blocking flow shop scheduling problem with different criteria, and Naderi et al [10] studied the multiobjective open shop problems by incorporating artificial immune and simulated annealing algorithms.…”

Section: Related Workmentioning

confidence: 99%

A hybrid artificial bee colony algorithm for optimal selection of QoS-based cloud manufacturing service composition

Zhou

Yao

2016

Int J Adv Manuf Technol

130

View full text Add to dashboard Cite

With the advent of cloud manufacturing (CMfg), more and more services in CMfg platforms may provide the same functionality but differ in performance. In order to insure the manufacturing cloud to match the complicated task requirements, composited CMfg service optimal selection (CCSOS) is becoming increasingly important. This study proposes a new approach for such CCSOS problems, the so-called hybrid artificial bee colony (HABC) algorithm, which employs both the probabilistic model of Archimedean copula estimation of distribution algorithm (ACEDA) and the chaos operators of global best-guided artificial bee colony to generate the offspring individuals with consideration of quality of service (QoS) and CMfg environment. Different-scale CCSOS problems are adopted to evaluate the performance of the proposed HABC. Experimental results have shown that the HABC can find better solutions compared with such algorithms as genetic algorithm, particle swarm optimization, and basic artificial bee colony algorithm.

show abstract

“…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

Optimizing blocking flow shop scheduling problem with total completion time criterion

Cited by 40 publications

References 31 publications

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

A hybrid artificial bee colony algorithm for optimal selection of QoS-based cloud manufacturing service composition

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

Contact Info

Product

Resources

About