Genetic Algorithm Application for Permutation Flow Shop Scheduling Problems

Arık, Oğuzhan Ahmet

doi:10.35378/gujs.682388

Cited by 2 publications

(2 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As we known, makespan, the complete time of the last job in a sequence, is one of the indicators that directly measures economic benefits. Let (C max ) min denote the minimum makespan and its expression is shown in Equation (1). The meanings of related symbols are as follows.…”

Section: Problem Descriptionmentioning

confidence: 99%

“…Production scheduling can meet that need, so it is used in manufacturing systems extensively. Considering the differences in factory conditions and job processing requirements, the scheduling problem has been divided into several kinds, such as flow shop [1,2], hybrid flow shop [3,4], job shop [5,6], open shop [7,8], and so on. The flow shop problem (FSP) claims that each job should be processed in the same order through every stage, and the hybrid flow shop refers to parallel machines at one or more stages.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion

et al. 2022

View full text Add to dashboard Cite

The No-wait Flowshop Scheduling Problem (NWFSP) has always been a research hotspot because of its importance in various industries. This paper uses a matheuristic approach that combines exact and heuristic algorithms to solve it with the objective to minimize the makespan. Firstly, according to the symmetry characteristics in NWFSP, a local search method is designed, where the first job and the last job in the symmetrical position remain unchanged, and then, a three-level neighborhood division method and the corresponding rapid evaluation method at each level are given. The two proposed heuristic algorithms are built on them, which can effectively avoid al-ready searched areas, so as to quickly obtain the local optimal solutions, and even directly obtain the optimal solutions for small-scale instances. Secondly, using the equivalence of this problem and the Asymmetric Traveling Salesman Problem (ATSP), an exact method for solving NWFSP is constructed. Importing the results of the heuristics into the model, the efficiency of the Mil-ler-Tucker-Zemlin (MTZ) model for solving small-scale NWFSP can be improved. Thirdly, the matheuristic algorithm is used to test 141 instances of the Tailard and Reeves benchmarks, and each optimal solution can be obtained within 134 s, which verifies the stability and effectiveness of the algorithm.

show abstract

Section: Problem Descriptionmentioning

confidence: 99%