Next Article in Journal
Multi-Level Joint Feature Learning for Person Re-Identification
Previous Article in Journal
p-Refined Multilevel Quasi-Monte Carlo for Galerkin Finite Element Methods with Applications in Civil Engineering
Open AccessArticle

Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion

Université de Lorraine, LGIPM, F-57000 Metz, France
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(5), 112; https://doi.org/10.3390/a13050112
Received: 30 March 2020 / Revised: 22 April 2020 / Accepted: 28 April 2020 / Published: 29 April 2020
Since its creation by Nawaz, Enscore, and Ham in 1983, NEH remains the best heuristic method to solve flowshop scheduling problems. In the large body of literature dealing with the application of this heuristic, it can be clearly noted that results differ from one paper to another. In this paper, two methods are proposed to improve the original NEH, based on the two points in the method where choices must be made, in case of equivalence between two job orders or partial sequences. When an equality occurs in a sorting method, two results are equivalent, but can lead to different final results. In order to propose the first improvement to NEH, the factorial basis decomposition method is introduced, which makes a number computationally correspond to a permutation. This method is very helpful for the first improvement, and allows testing of all the sequencing possibilities for problems counting up to 50 jobs. The second improvement is located where NEH keeps the best partial sequence. Similarly, a list of equivalent partial sequences is kept, rather than only one, to provide the global method a chance of better performance. The results obtained with the successive use of the two methods of improvement present an average improvement of 19% over the already effective results of the original NEH method. View Full-Text
Keywords: NEH; flowshop; scheduling; heuristic; methods; factorial basis decomposition NEH; flowshop; scheduling; heuristic; methods; factorial basis decomposition
Show Figures

Figure 1

MDPI and ACS Style

Sauvey, C.; Sauer, N. Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion. Algorithms 2020, 13, 112.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop