Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine
Authors
Keywords
-
Journal
EVOLUTIONARY COMPUTATION
Volume -, Issue -, Pages 1-25
Publisher
MIT Press - Journals
Online
2020-12-23
DOI
10.1162/evco_a_00287
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Multi-objective flow shop scheduling with limited buffers using hybrid self-adaptive differential evolution
- (2019) Jing Liang et al. Memetic Computing
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
- (2019) Guanghui Zhang et al. COMPUTERS & OPERATIONS RESEARCH
- Flexible flow shop with dedicated buffers
- (2018) Andreas Ernst et al. DISCRETE APPLIED MATHEMATICS
- A new improved NEH heuristic for permutation flowshop scheduling problems
- (2017) Weibo Liu et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Permutation schedules for a two-machine flow shop with storage
- (2016) Joey Fung et al. OPERATIONS RESEARCH LETTERS
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- (2015) Victor Fernandez-Viagas et al. COMPUTERS & OPERATIONS RESEARCH
- New hard benchmark for flowshop scheduling problems minimising makespan
- (2015) Eva Vallada et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm
- (2015) Jun-qing Li et al. INFORMATION SCIENCES
- An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers
- (2015) Su-jun Zhang et al. Journal of Central South University
- Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem
- (2014) Thomas Weise et al. IEEE Computational Intelligence Magazine
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
- (2013) Ghasem Moslehi et al. COMPUTERS & OPERATIONS RESEARCH
- Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries
- (2012) Feng-Cheng Lin et al. INFORMATION SYSTEMS
- A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers
- (2011) Quan-Ke Pan et al. APPLIED SOFT COMPUTING
- Optimisation of flow-shop scheduling with batch processor and limited buffer
- (2011) Qing Fu et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers
- (2010) Quan-Ke Pan et al. INFORMATION SCIENCES
- On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming
- (2010) J A Vázquez-Rodríguez et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- 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 two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentations
- (2008) Feng-Cheng Lin et al. COMPUTERS & OPERATIONS RESEARCH
- Scheduling a flow shop with combined buffer conditions
- (2008) Shi Qiang Liu et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- (2007) Bo Liu 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
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now