An improved NEH-based heuristic for the permutation flowshop problem

Dong, Xianguang; Huang, Houkuan; Chen, Ping

doi:10.1016/j.cor.2007.05.005

Cited by 124 publications

(73 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As we will show, several authors have recently been unable to assess outperformance in Taillard's benchmark due to several factors that we will later point out. Notable examples are Dong and Ping Chen (2008) and Kalczynski and Kamburowski (2008). These authors could not find statistically better performance using Taillard's benchmark and showed that using other randomly generated instances of their own, better performance was observed.…”

Section: Introductionmentioning

confidence: 90%

“…More recent methods, such as those of Dong and Ping Chen (2008), Kalczynski and Kamburowski (2008) or Rad et al (2009) have shown NEH outperforming algorithms. As regards metaheuristics, the list is also long.…”

Section: Flowshop Scheduling Problem and The Hardness Of The Instancesmentioning

confidence: 99%

“…According to Ruiz and Maroto (2005), the NEH heuristic was the most successful. Dong and Ping Chen (2008) proposed an improvement of the NEH and the authors already needed another benchmark of instances for the comparison since with Taillard's instances they could not show statistically significant differences.…”

Section: Heuristicsmentioning

confidence: 99%

“…Specifically the NEH developed by Nawaz et al (1983) and NEHD, which is a modification and improvement of NEH, proposed by Dong and Ping Chen (2008) were selected since they are considered the most effective ones. According to Ruiz and Maroto (2005), the NEH heuristic was the most successful.…”

Section: Heuristicsmentioning

confidence: 99%

See 3 more Smart Citations

New hard benchmark for flowshop scheduling problems minimising makespan

Vallada

Ruíz

Framiñán

2015

European Journal of Operational Research

152

View full text Add to dashboard Cite

In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small instances with up to 800 jobs and 60 machines. One of the objectives of the work is to generate a benchmark which satisfies the desired characteristics of any benchmark: comprehensive, amenable for statistical analysis and discriminant when several algorithms are compared. An exhaustive experimental procedure is carried out in order to select the hard instances, generating thousands of instances and selecting the hardest ones from the point of view of a gap computed as the difference between very good upper and lower bounds for each instance. Extensive generation and computational experiments, which have taken almost six years of combined CPU time, demonstrate that the proposed benchmark is harder and with more discriminant power than the most common benchmark from the literature. Moreover, a website is developed for researchers in order to share sets of instances, best known solutions and lower bounds, etc. for any combinatorial optimisation problem.

show abstract

Section: Introductionmentioning

confidence: 90%

Section: Flowshop Scheduling Problem and The Hardness Of The Instancesmentioning

confidence: 99%

Section: Heuristicsmentioning

confidence: 99%

Section: Heuristicsmentioning

confidence: 99%

See 2 more Smart Citations

New hard benchmark for flowshop scheduling problems minimising makespan

Vallada

Ruíz

Framiñán

2015

European Journal of Operational Research

152

View full text Add to dashboard Cite

show abstract

“…The performance of NEH algorithm was improved by improving the sorting step by Xiao-ping et al (2004). Dong et al (2008) ordered the jobs by the sums of the average processing time and the standard deviations of processing times to achieve the improvement. The Min-Max algorithm developed by Ronconi (2004) addresses the makespan minimization PFSP with no buffers.…”

Section: Introductionmentioning

confidence: 99%

Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling

Baskar¹

2016

10.5267/j.ijiec

View full text Add to dashboard Cite

Permutation flow shop scheduling problems have been an interesting area of research for over six decades. Out of the several parameters, minimization of makespan has been studied much over the years. The problems are widely regarded as NP-Complete if the number of machines is more than three. As the computation time grows exponentially with respect to the problem size, heuristics and meta-heuristics have been proposed by many authors that give reasonably accurate and acceptable results. The NEH algorithm proposed in 1983 is still considered as one of the best simple, constructive heuristics for the minimization of makespan. This paper analyses the powerful job insertion technique used by NEH algorithm and proposes seven new variants, the complexity level remains same. 120 numbers of problem instances proposed by Taillard have been used for the purpose of validating the algorithms. Out of the seven, three produce better results than the original NEH algorithm.

show abstract

Hybrid grey wolf optimizer for solving permutation flow shop scheduling problem

Chen,

Zheng

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThe permutation flow shop scheduling problem, as a classical problem in the scheduling field, is an NP‐hard problem. However, most of the reported algorithms are difficult to achieve good accuracy and efficiency. To address this problem, a hybrid grey wolf optimizer (HGWO) is proposed in this paper. First, one cooperative initialization strategy is proposed to improve the quality of the initial solution based on the improved Nawaz‐Enscore‐Ham (NEH) method and the tent chaotic map method. Second, a levy flight strategy is introduced to balance the exploitation and exploration of the algorithm for the problem's characteristics. Third, the crossover and mutation strategy, and the critical block exchange based on critical path strategy are proposed to avoid falling into the local optimum. In addition, for the best individual, the variable neighborhood descent strategy is proposed to enhance the convergence accuracy of the algorithm. To verify the performance of the proposed algorithm, three different types of instances are selected for comparison experiments with other existing methods, and the experimental results show that the proposed HGWO outperforms other comparison algorithms in solving the problem.

show abstract

An improved NEH-based heuristic for the permutation flowshop problem

Cited by 124 publications

References 19 publications

New hard benchmark for flowshop scheduling problems minimising makespan

New hard benchmark for flowshop scheduling problems minimising makespan

Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling

Hybrid grey wolf optimizer for solving permutation flow shop scheduling problem

Contact Info

Product

Resources

About