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

Podrobná bibliografia

Vydané v:	Journal of physics. Conference series Ročník 1818; číslo 1; s. 12042
Hlavný autor:	Motair, Hafed M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Bristol IOP Publishing 01.03.2021
Predmet:	Algorithms Heuristic methods Job shop scheduling Job shops Mathematical analysis Permutations Physics Simulated annealing
ISSN:	1742-6588, 1742-6596
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!