Translator Disclaimer
2020 Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time
Jabrane Belabid, Said Aqil, Karam Allali
J. Appl. Math. 2020(none): 1-11 (2020). DOI: 10.1155/2020/7132469


In this paper, we study the resolution of a permutation flow shop problem with sequence-independent setup time. The objective is to minimize the maximum of job completion time, also called the makespan. In this contribution, we propose three methods of resolution, a mixed-integer linear programming (MILP) model; two heuristics, the first based on Johnson’s rule and the second based on the NEH algorithm; and finally two metaheuristics, the iterative local search algorithm and the iterated greedy algorithm. A set of test problems is simulated numerically to validate the effectiveness of our resolution approaches. For relatively small-size problems, it has been revealed that the adapted NEH heuristic has the best performance than that of the Johnson-based heuristic. For the relatively medium and large problems, the comparative study between the two metaheuristics based on the exploration of the neighborhood shows that the iterated greedy algorithm records the best performances.


Download Citation

Jabrane Belabid. Said Aqil. Karam Allali. "Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time." J. Appl. Math. 2020 1 - 11, 2020.


Received: 28 August 2019; Revised: 3 December 2019; Accepted: 31 December 2019; Published: 2020
First available in Project Euclid: 14 May 2020

zbMATH: 07195536
MathSciNet: MR4059041
Digital Object Identifier: 10.1155/2020/7132469

Rights: Copyright © 2020 Hindawi


This article is only available to subscribers.
It is not available for individual sale.

Vol.2020 • 2020
Back to Top