Tabu-search optimization approach for no-wait hybrid flow-shop scheduling with dedicated machines
Houda Harbaoui, Soulef Khalfallah
Abstract
In this paper, the no-wait two-stage hybrid flow shop scheduling problem, under makespan minimization is addressed. A special attention will also be given to solutions with no-idle time as such solution limits material waste. We compare the performance of two metaheuristics, that are Tabu search (TS) and Genetic Algorithm (GA). For both approaches, when two solutions have the same makespan, the one with zero or smaller idle time is privileged.
Topics & Concepts
Tabu searchJob shop schedulingComputer scienceFlow shop schedulingMetaheuristicMathematical optimizationIdleMinificationScheduling (production processes)Genetic algorithmAlgorithmScheduleMathematicsOperating systemMachine learningProgramming languageScheduling and Optimization AlgorithmsAdvanced Manufacturing and Logistics OptimizationAssembly Line Balancing Optimization