New benchmark algorithm for hybrid flowshop scheduling with identical machines
Authors:
- Shih-Wei LinShih-Wei Lin
- Chen-Yang ChengCCChen-Yang Cheng
- Pourya PourhejazyPPPourya Pourhejazy
- Kuo-Ching YingKuo-Ching Ying
- Chia-Hui LeeCLChia-Hui Lee
- 1 November 2021
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 183
Abstract
No abstract availableKeywords
Funding Information
- Chang Gung Memorial Hospital, Linkou (BMRPA19)
- Ministry of Science and Technology of the People's Republic of China (MOST108-2221-E-027-025)
- Ministry of Science and Technology, Taiwan
This publication has 47 references indexed in Scilit:
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithmComputers & Operations Research, 2013
- Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planningComputers & Operations Research, 2013
- An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problemApplied Soft Computing, 2012
- Chaotic bee colony algorithms for global numerical optimizationExpert Systems with Applications, 2010
- An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasksJournal of the Operational Research Society, 2009
- Scheduling jobs on a k-stage flexible flow-shopAnnals of Operations Research, 2007
- An Exact Method for Solving the Multi-Processor Flow-ShopRAIRO - Operations Research, 2000
- Hybrid flow shop scheduling: A surveyComputers & Industrial Engineering, 1999
- Optimization by Simulated AnnealingScience, 1983
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954