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
id sg-ntu-dr.10356-106812
record_format dspace
spelling sg-ntu-dr.10356-1068122019-12-06T22:18:55Z A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion Tasgetiren, M. Fatih. Pan, Quan-Ke. Suganthan, P. N. Oner, Adalet. School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering 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 allowed on machines. In other words, the start time of processing the first job on a given machine must be delayed in order to satisfy the no-idle constraint. The paper presents the following contributions: First of all, a discrete artificial bee colony algorithm is presented to solve the problem on hand first time in the literature. Secondly, some novel methods of calculating the total tardiness from makespan are introduced for the no-idle permutation flowshop scheduling problem. Finally, the main contribution of the paper is due to the fact that a novel speed-up method for the insertion neighborhood is developed for the total tardiness criterion. The performance of the discrete artificial bee colony algorithm is evaluated against a traditional genetic algorithm. The computational results show its highly competitive performance when compared to the genetic algorithm. Ultimately, we provide the best known solutions for the total tardiness criterion with different due date tightness levels for the first time in the literature for the Taillard’s benchmark suit. 2013-10-21T03:47:24Z 2019-12-06T22:18:55Z 2013-10-21T03:47:24Z 2019-12-06T22:18:55Z 2013 2013 Journal Article Tasgetiren, M. F., Pan, Q.-K., Suganthan, P.,& Oner, A. (2013). A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Applied Mathematical Modelling, 37(10-11), 6758-6779. 0307-904X https://hdl.handle.net/10356/106812 http://hdl.handle.net/10220/16643 http://dx.doi.org/10.1016/j.apm.2013.02.011 en Applied mathematical modelling
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering
spellingShingle DRNTU::Engineering::Electrical and electronic engineering
Tasgetiren, M. Fatih.
Pan, Quan-Ke.
Suganthan, P. N.
Oner, Adalet.
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
description 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 allowed on machines. In other words, the start time of processing the first job on a given machine must be delayed in order to satisfy the no-idle constraint. The paper presents the following contributions: First of all, a discrete artificial bee colony algorithm is presented to solve the problem on hand first time in the literature. Secondly, some novel methods of calculating the total tardiness from makespan are introduced for the no-idle permutation flowshop scheduling problem. Finally, the main contribution of the paper is due to the fact that a novel speed-up method for the insertion neighborhood is developed for the total tardiness criterion. The performance of the discrete artificial bee colony algorithm is evaluated against a traditional genetic algorithm. The computational results show its highly competitive performance when compared to the genetic algorithm. Ultimately, we provide the best known solutions for the total tardiness criterion with different due date tightness levels for the first time in the literature for the Taillard’s benchmark suit.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Tasgetiren, M. Fatih.
Pan, Quan-Ke.
Suganthan, P. N.
Oner, Adalet.
format Article
author Tasgetiren, M. Fatih.
Pan, Quan-Ke.
Suganthan, P. N.
Oner, Adalet.
author_sort Tasgetiren, M. Fatih.
title A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
title_short A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
title_full A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
title_fullStr A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
title_full_unstemmed A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
title_sort discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
publishDate 2013
url https://hdl.handle.net/10356/106812
http://hdl.handle.net/10220/16643
http://dx.doi.org/10.1016/j.apm.2013.02.011
_version_ 1681047615804801024