Blocking flowshop scheduling problems with release dates

Swarm and Evolutionary Computation - Tập 74 - Trang 101140 - 2022
Danyu Bai1, Xiaoyuan Bai1, Haoran Li2, Quan-Ke Pan3, Chin‐Chia Wu4, Liang Gao2, Meiting Guo5, Lin Lin5
1School of Maritime Economics & Management, Dalian Maritime University, Dalian 116026, China
2School of Mechanical Science & Engineering, Huazhong University of Science & Technology, Wuhan 430074, China
3School of Mechatronic Engineering & Automation, Shanghai University, Shanghai 200072, China
4Department of Statistics, Feng Chia University, Taichung, 40724, Taiwan
5Software College, Northeastern University, Shenyang 110169, China

Tóm tắt

Từ khóa


Tài liệu tham khảo

Gao, 2020, A survey on meta-heuristics for solving disassembly line balancing, planning and scheduling problems in remanufacturing, Swarm Evol. Comput., 57, 10.1016/j.swevo.2020.100719

Fu, 2021, Distributed scheduling problems in intelligent manufacturing systems, Tsinghua Sci. Technol., 26, 625, 10.26599/TST.2021.9010009

Fu, 2019, Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm, J. Intell. Manuf., 30, 2257, 10.1007/s10845-017-1385-4

Gao, 2018, Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm, IEEE Trans. Cybern., 49, 1944, 10.1109/TCYB.2018.2817240

Miyata, 2019, The blocking flow shop scheduling problem: a comprehensive and conceptual review, Expert Syst. Appl., 137, 130, 10.1016/j.eswa.2019.06.069

Lawler, 1982, Recent developments in deterministic sequencing and scheduling: a survey, 35

Soukhal, 2005, Complexity of flow shop scheduling problems with transportation constraints, Eur. J. Oper. Res., 161, 32, 10.1016/j.ejor.2003.03.002

Nagano, 2020, An improved lower bound for the blocking permutation flow shop with total completion time criterion, Comput. Ind. Eng., 146, 10.1016/j.cie.2020.106511

Shao, 2019, An efficient discrete invasive weed optimization for blocking flow-shop scheduling problem, Eng. Appl. Artif. Intell., 78, 124, 10.1016/j.engappai.2018.11.005

Doush, 2019, Flow shop scheduling with blocking using modified harmony search algorithm with neighboring heuristics methods, Appl. Soft Comput., 85

Cheng, 2021, New benchmark algorithm for minimizing total completion time in blocking flowshops with sequence-dependent setup times, Appl. Soft Comput., 104, 10.1016/j.asoc.2021.107229

Yuan, 2020, A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times, Expert Syst. Appl., 152, 10.1016/j.eswa.2020.113360

Newton, 2019, Scheduling blocking flowshops with setup times via constraint guided and accelerated local search, Comput. Oper. Res., 109, 64, 10.1016/j.cor.2019.04.024

Aqil, 2021, On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time, Ann. Oper. Res., 296, 615, 10.1007/s10479-019-03490-x

Shao, 2019, A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem, Knowl. Based Syst., 165, 110, 10.1016/j.knosys.2018.11.021

Han, 2020, Discrete evolutionary multi-objective optimization for energy-efficient blocking flow shop scheduling with setup time, Appl. Soft Comput., 93, 10.1016/j.asoc.2020.106343

Deng, 2021, Migrating birds optimization with a diversified mechanism for blocking flow shops to minimize idle and blocking time, Appl. Soft Comput.

Rajasekhar, 2017, Computing with the collective intelligence of honey bees–a survey, Swarm Evol. Comput., 32, 25, 10.1016/j.swevo.2016.06.001

Meng, 2018, A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations, Int. J. Prod. Res., 56, 5278, 10.1080/00207543.2018.1467575

Li, 2015, An improved artificial bee colony algorithm for solving hybrid flexible flowshop with dynamic operation skipping, IEEE Trans. Cybern., 46, 1311, 10.1109/TCYB.2015.2444383

Pan, 2016, An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling, Eur. J. Oper. Res., 250, 702, 10.1016/j.ejor.2015.10.007

Li, 2017, Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems, Comput. Ind. Eng., 113, 10, 10.1016/j.cie.2017.09.005

Lei, 2020, An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance, Comput. Ind. Eng., 141, 10.1016/j.cie.2020.106320

Zou, 2020, An effective discrete artificial bee colony algorithm for multi-AGVs dispatching problem in a matrix manufacturing workshop, Expert Syst. Appl., 161, 10.1016/j.eswa.2020.113675

Li, 2020, An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times, Comput. Ind. Eng., 147, 10.1016/j.cie.2020.106638

Li, 2019, Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs, IEEE Trans. Cybern., 50, 2425, 10.1109/TCYB.2019.2943606

Meng, 2021, A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time, Swarm Evol. Comput., 60, 10.1016/j.swevo.2020.100804

Cheng, 2021, Unsupervised learning-based artificial bee colony for minimizing non-value-adding operations, Appl. Soft Comput., 105, 10.1016/j.asoc.2021.107280

Bai, 2021, Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans, Int. J. Prod. Res., 1

Zhang, 2019, A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem, Comput. Ind. Eng., 136, 325, 10.1016/j.cie.2019.07.036

Yüksel, 2020, An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption, Comput. Ind. Eng., 145, 10.1016/j.cie.2020.106431

Lei, 2021, An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling, Int. J. Prod. Res., 59, 5259, 10.1080/00207543.2020.1775911

Wang, 2021, A discrete artificial bee colony algorithm for multiobjective disassembly line balancing of end-of-life products, IEEE Trans. Cybern.

Pinedo, 2012

Zdrzak̵a, 1989, An algorithm for single machine sequencing with release dates to minimize maximum cost, Discrete Appl. Math., 23, 73, 10.1016/0166-218X(89)90036-X

Kaminsky, 2003, The effectiveness of the longest delivery time rule for the flow shop delivery time problem, Naval Res. Logistics (NRL), 50, 257, 10.1002/nav.10054

Moslehi, 2013, Optimizing blocking flow shop scheduling problem with total completion time criterion, Comput. Oper. Res., 40, 1874, 10.1016/j.cor.2013.02.003

Karaboga, 2005

Pan, 2011, A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem, Inf. Sci., 181, 2455, 10.1016/j.ins.2009.12.025

Taillard, 1993, Benchmarks for basic scheduling problems, Eur. J. Oper. Res., 64, 278, 10.1016/0377-2217(93)90182-M

Zhao, 2020, An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion, Expert Syst. Appl., 160, 10.1016/j.eswa.2020.113678

Pan, 2011, An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem, Int. J. Adv. Manuf. Technol., 52, 699, 10.1007/s00170-010-2775-3

Ren, 2017, Permutation flow-shop scheduling problem to optimize a quadratic objective function, Eng. Optim., 49, 1589, 10.1080/0305215X.2016.1261127

Zhao, 2021, A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem, Comput. Ind. Eng., 153, 10.1016/j.cie.2020.107082