Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm

Lin, Shih-Wei; Ying, Kuo‐Ching; Huang, Chien‐Yi

doi:10.1080/00207543.2013.790571

Cited by 169 publications

(52 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For C = 40 all 720 best known solutions are already improved. Comparatively, the recently proposed IG algorithm of Lin et al (2013) was reported in that paper to have improved "almost half" of the instances of Naderi and Ruiz (2010). A similar indirect test can be carried out with the untested EDA algorithm of Wang et al (2013).…”

Section: Metaheuristic Results For Large Instancesmentioning

confidence: 96%

“…We can also comment on the recent IG method of Lin et al (2013). We can see that the IG beats all other existing metaheuristics clearly, bringing down the relative percentage deviation to just 2.34%.…”

Section: Metaheuristic Results For Large Instancesmentioning

confidence: 99%

“…• The best iterated greedy algorithm of Lin et al (2013) which the authors called IG V ST and is simply referred to as IG here.…”

Section: Methods Compared and Experimental Settingmentioning

confidence: 99%

“…Also recently, Lin et al (2013) have presented an iterated greedy method inspired by the work of Ruiz and Stützle (2007). Four IG variants are presented and the best one, denoted as IG V ST is compared against the HGA of Gao and Chen (2011a) and the TS of Gao et al (2013).…”

Section: Literature Reviewmentioning

confidence: 99%

See 3 more Smart Citations

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

229

View full text Add to dashboard Cite

The distributed permutation flowshop problem has been recently proposed as a generalization of the regular flowshop setting where more than one factory is available to process jobs. Distributed manufacturing is a common situation for large enterprises that compete in a globalized market. The problem has two dimensions: assigning jobs to factories and scheduling the jobs assigned to each factory. Despite being recently introduced, this interesting scheduling problem has attracted attention and several heuristic and metaheuristic methods have been proposed in the literature. In this paper we present a scatter search (SS) method for this problem to optimize makespan. SS has seldom been explored for flowshop settings. In the proposed algorithm we employ some advanced techniques like a reference set made up of complete and partial solutions along with other features like restarts and local search. A comprehensive computational campaign including 10 existing algorithms, together with statistical analyses, shows that the proposed scatter search algorithm produces better results than existing algorithms by a significant margin. Moreover all 720 known best solutions for this problem are improved.

show abstract

Section: Metaheuristic Results For Large Instancesmentioning

confidence: 96%

Section: Metaheuristic Results For Large Instancesmentioning

confidence: 99%

“…• The best iterated greedy algorithm of Lin et al (2013) which the authors called IG V ST and is simply referred to as IG here.…”

Section: Methods Compared and Experimental Settingmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

See 2 more Smart Citations

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

229

View full text Add to dashboard Cite

show abstract

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

Iterated Greedy

Stützle

Ruíz

2018

Handbook of Heuristics

View full text Add to dashboard Cite

Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm

Cited by 169 publications

References 24 publications

A scatter search algorithm for the distributed permutation flowshop scheduling problem

A scatter search algorithm for the distributed permutation flowshop scheduling problem

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

Iterated Greedy

Contact Info

Product

Resources

About