An iterated greedy algorithm for the flowshop scheduling problem with blocking

Ribas, Imma; Companys, Ramón; Tort‐Martorell, Xavier

doi:10.1016/j.omega.2010.07.007

Cited by 179 publications

(87 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Depending on the solution feasibility, a repair method could also be used in order to enhance the algorithm's effectiveness. IG has been employed to solve many scheduling problems [35][36][37][38][39], including the static permutation flowshop scheduling problems (PFSP) [40]. However, it tends to be trapped to local optimum.…”

Section: Related Workmentioning

confidence: 99%

New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival

Liu

Jin

Price

2018

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Permutation flowshop scheduling problem (PFSP) has attracted lots of attention from both academia and industry as it finds many applications especially for today's mass customization. The PFSP is proved NP-hard, and the dynamic uncertainties such as stochastic new order arrivals significantly increase the problem complexity and difficulty. Many enterprises often struggle to make decisions on accepting new orders and setting due dates for them due to lack of effective scheduling methods. To fill in the knowledge gap, this paper is to propose a new meta-heuristic algorithm which is based on a new enhanced destruction and construction method and a novel repair method while adopting the architecture of the iterated greedy algorithm. Statistical tests were conducted and results show that the new algorithm outperforms existing ones. The maximum completion time of the new order

show abstract

Section: Related Workmentioning

confidence: 99%

New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival

Liu

Jin

Price

2018

Int J Adv Manuf Technol

View full text Add to dashboard Cite

show abstract

“…This approach has been followed in Ruiz, Maroto and Alcaraz (2006), Ruiz and Stutzle (2007), Ribas, Companys, and Tort-Martorell (2011), among many others. case, factor ε .…”

Section: Calibration Of the Proposed Edamentioning

confidence: 99%

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

Pan

Ruíz

2012

Omega

143

View full text Add to dashboard Cite

Lot-streaming flow shops have important applications in different industries including textile, plastic, chemical, semiconductor, and many others. This paper considers an n-job m-machine lot-streaming flow shop scheduling problem with sequence-dependent setup times under both the idling and no-idling production cases. The objective is to minimize the maximum completion time or makespan. To solve this important practical problem, a novel estimation of distribution algorithm (EDA) is proposed with a job permutation based representation. In the proposed EDA, an efficient initialization scheme based on the NEH heuristic is presented to construct an initial population with a certain level of quality and diversity. An estimation of a probabilistic model is constructed to direct the algorithm search towards good solutions by taking into account both job permutation and similar blocks of jobs. A simple but effective local search is added to enhance the intensification capability. A diversity controlling mechanism is applied to maintain the diversity of the population. In addition, a speed-up method is presented to reduce the computational effort needed for the local search technique and the NEH-based heuristics. A comparative evaluation is carried out with the best performing algorithms from the literature. The results show that the proposed EDA is very effective in comparison after comprehensive computational and statistical analyses.

show abstract

“…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). But few studies deal with the makespan criterion in the flowshop environment with blocking.…”

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

An iterated greedy algorithm for the flowshop scheduling problem with blocking

Cited by 179 publications

References 26 publications

New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival

New meta-heuristic for dynamic scheduling in permutation flowshop with new order arrival

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

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

Contact Info

Product

Resources

About