Exact and Hybrid Metaheuristic Algorithms to Solve Bi-Objective Permutation Flow Shop Scheduling Problem

In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-objective of minimizing the makespan ( C max ) and maximum tardiness ( T max ). The aim is to minimize the two objective functions lexicographicaly, which is minimize maximum tardiness subject to that the makespan...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 1818; číslo 1; s. 12042
Hlavní autor: Motair, Hafed M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.03.2021
Témata:
Algorithms
Heuristic methods
Job shop scheduling
Job shops
Mathematical analysis
Permutations
Physics
Simulated annealing
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-objective of minimizing the makespan ( C max ) and maximum tardiness ( T max ). The aim is to minimize the two objective functions lexicographicaly, which is minimize maximum tardiness subject to that the makespan is optimal. We introduce a Branch and bound algorithm with two dominance conditions to find the optimal solution of the problem for job sequence with up to 14 jobs. For moderate and large sized problems we apply a simulated annealing algorithm to develop a metaheuristic algorithme based on the first level branch and bound and variable neighborhood search. To compare with the original algorithm, numerical experiments provided, the rusults shows the efficiency of the dominance conditions also the efficiency of proposed modification of the original metaheuristic algorithm.
Bibliografie:ObjectType-Conference Proceeding-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1818/1/012042