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

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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	4OR Ročník 22; číslo 1; s. 31 - 45
Hlavní autori:	de Almeida, Fernando Siqueira, Nagano, Marcelo Seido
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024 Springer Nature B.V
Predmet:	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
ISSN:	1619-4500, 1614-2411
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!