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

• Published in: Journal of physics. Conference series Vol. 1818; no. 1; p. 12042
• Main Author: Motair, Hafed M.
• Format: Journal Article
• Language: English
• Published: Bristol IOP Publishing 01.03.2021
• Subjects: Algorithms; Heuristic methods; Job shop scheduling; Job shops; Mathematical analysis; Permutations; Physics; Simulated annealing

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