Solving Permutation Flow Shop Scheduling Problem with Sequence‐Independent Setup Time

Jabrane Belabid, Said Aqil and Karam Allali

Journal of Applied Mathematics, 2020, vol. 2020, issue 1

Abstract: 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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2020/7132469

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2020:y:2020:i:1:n:7132469

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().