An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times

• Published in: 4OR Vol. 22; no. 1; pp. 31 - 45
• Main Authors: de Almeida, Fernando Siqueira, Nagano, Marcelo Seido
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024; Springer Nature B.V
• Subjects: Business and Management; Greedy algorithms; Industrial and Production Engineering; Job shop scheduling; Multiple criterion; Operations research; Operations Research/Decision Theory; Optimization; Research Paper; Setup times; Upper bounds; No-wait; 68T20; Iterated greedy; Flow shop; Makespan; 90C59; Sequence-dependent setup; Total tardiness

In this article, we address the m -machine no-wait flow shop scheduling problem with sequence dependent setup times. The objective is to minimize total tardiness subject to an upper bound on makespan. Although these constraints and performance measures have all been extensively studied independently...