Iterated Greedy Algorithms for Flow-Shop Scheduling Problems: A Tutorial

An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling problems. IGA was first developed to solve an FSP in 2007. Since then, various FSPs have been tackled by usin...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automation science and engineering Ročník 19; číslo 3; s. 1941 - 1959
Hlavní autori:	Zhao, ZiYan, Zhou, MengChu, Liu, ShiXin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.07.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Engineers Flow-shop scheduling problem (FSP) Greedy algorithms heuristic algorithm Heuristic algorithms Heuristic methods iterated greedy algorithm (IGA) Job shop scheduling Job shops Linear programming Literature reviews Optimization Production scheduling review Scheduling Search methods Source code tutorial Tutorials Websites
ISSN:	1545-5955, 1558-3783
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!