Makespan Minimization for the Two-Stage Hybrid Flow Shop Problem with Dedicated Machines: A Comprehensive Study of Exact and Heuristic Approaches

This paper presents a comprehensive approach for minimizing makespan in the challenging two-stage hybrid flowshop with dedicated machines, a problem known to be strongly NP-hard. This study proposed a constraint programming approach, a novel heuristic based on a priority rule, and Tabu search proced...

Full description

Bibliographic Details

Published in:	Computation
Main Authors:	Mohamed Karim Hajji, Hatem Hadda, Najoua Dridi
Format:	Article
Language:	English
Published:	MDPI AG 2023-07-01
Subjects:	scheduling two-stage flowshop problem dedicated machines constraint programming tabu search heuristic
Online Access:	https://www.mdpi.com/2079-3197/11/7/137