A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem

This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG_DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from a sequence and re-inserted into all possible positions of the remaining seque...

Full description

Saved in:
Bibliographic Details
Main Authors: Fatih Tasgetiren, M., Suganthan, P. N., Pan, Quan-Ke, Buyukdagli, Ozge
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/107365
http://hdl.handle.net/10220/17525
http://dx.doi.org/10.1016/j.cor.2013.01.005
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English

Similar Items