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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automation science and engineering Vol. 19; no. 3; pp. 1941 - 1959
Main Authors:	Zhao, ZiYan, Zhou, MengChu, Liu, ShiXin
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!