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...
Saved in:
Main Authors: | Tasgetiren, M. Fatih., Pan, Quan-Ke., Suganthan, P. N., Oner, Adalet. |
---|---|
其他作者: | School of Electrical and Electronic Engineering |
格式: | Article |
語言: | English |
出版: |
2013
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/106812 http://hdl.handle.net/10220/16643 http://dx.doi.org/10.1016/j.apm.2013.02.011 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
由: Fatih Tasgetiren, M., et al.
出版: (2013) -
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
由: Pan, Quan-Ke, et al.
出版: (2016) -
Hybrid Artificial Bee Colony (ABC) Dan Harmony Search (HS) Untuk Menyelesaikan Permutation Flowshop Scheduling Problem (PFSP)
由: Talitha Rahim Rusdiana
出版: (2020) -
Novel MILP models for scheduling permutation flowshops
由: Pitty, S.S., et al.
出版: (2014) -
HYBRID ALGORITMA ARTIFICIAL BEE COLONY (ABC)
DAN IMPROVED PARTICLE SWARM OPTIMIZATION (IPSO)
UNTUK PENYELESAIAN PERMUTATION FLOWSHOP
SCHEDULING PROBLEM (PFSP)
由: FIRDHA OCTAVIANA, 081211233033
出版: (2016)