A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant of the well-known permutation flowshop scheduling problem where idle time is not...

Full description

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