A Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem

No-idle permutation flowshop scheduling problem (NIPFSP) is a well-known NP-hard problem, in which each machine must perform the jobs consecutively without any idle time. Even though various algorithms have been proposed for this problem, energy efficiency has not been considered in these studies. I...

Full description

Bibliographic Details

Published in:	Procedia manufacturing Vol. 39; pp. 1185 - 1193
Main Authors:	Tasgetiren, M.Fatih, Öztop, Hande, Gao, Liang, Pan, Quan-Ke, Li, Xinyu
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2019
Subjects:	energy-efficient scheduling genetic algorithm iterated local search multi-objective optimization no-idle flowshop scheduling genetic algorithm no-idle flowshop scheduling energy-efficient scheduling multi-objective optimization iterated local search
ISSN:	2351-9789, 2351-9789
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!