An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers
出版年份 2015 全文链接
标题
An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers
作者
关键词
discrete artificial bee colony algorithm, flow shop scheduling problem with intermediate buffers, destruction and construction, tournament selection
出版物
Journal of Central South University
Volume 22, Issue 9, Pages 3471-3484
出版商
Springer Nature
发表日期
2015-09-08
DOI
10.1007/s11771-015-2887-x
参考文献
相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。- A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation
- (2014) Quan-Ke Pan et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- (2013) M. Fatih Tasgetiren et al. APPLIED MATHEMATICAL MODELLING
- A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling
- (2013) Guanlong DENG et al. CHINESE JOURNAL OF CHEMICAL ENGINEERING
- A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem
- (2012) X. Li et al. Scientia Iranica
- A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers
- (2011) Quan-Ke Pan et al. APPLIED SOFT COMPUTING
- A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem
- (2011) Yan-Feng Liu et al. APPLIED SOFT COMPUTING
- A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
- (2011) M. Fatih Tasgetiren et al. INFORMATION SCIENCES
- An improved artificial bee colony algorithm for the blocking flowshop scheduling problem
- (2011) Yu-Yan Han et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers
- (2010) Quan-Ke Pan et al. INFORMATION SCIENCES
- A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
- (2010) Quan-Ke Pan et al. INFORMATION SCIENCES
- A note of using effective immune based approach for the flow shop scheduling with buffers
- (2009) Y.-C. Hsieh et al. APPLIED MATHEMATICS AND COMPUTATION
- A discrete differential evolution algorithm for the permutation flowshop scheduling problem
- (2008) Quan-Ke Pan et al. COMPUTERS & INDUSTRIAL ENGINEERING
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- (2008) Xingye Dong et al. COMPUTERS & OPERATIONS RESEARCH
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- (2008) Ling Wang et al. COMPUTERS & OPERATIONS RESEARCH
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- (2008) Lin-Yu Tseng et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
- (2008) B. Qian et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- (2007) Bo Liu et al. COMPUTERS & OPERATIONS RESEARCH
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
- (2007) Xianpeng Wang et al. COMPUTERS & OPERATIONS RESEARCH
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- (2007) Bin Qian et al. COMPUTERS & OPERATIONS RESEARCH
Create your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started