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

• 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: DRNTU::Engineering::Electrical and electronic engineering
• 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
• Institution: Nanyang Technological University

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