The classical energy-efficient flexible job shop problem (EFJSP) assumes that the waiting time between adjacent operations does not have strict requirements. However, in many actual industrial environments, the phenomenon that the waiting time cannot exceed a specified value is very common. With regard to this, we propose an EFJSP with the limited waiting time (EFJSP-LWT) with minimization of makespan and total energy consumption. To solve this problem, we develop a knowledge-guided grouping artificial bee colony (KGGABC) algorithm to solve it. In KGGABC, a grouping employed bee phase is designed, a modified selection method and knowledge are given in onlooker bee phase. In addition, a new principle is proposed to compare solutions. Finally, extensive experiments are conducted and the results demonstrate that KGGABC outperforms all compared algorithms over 90% instances in solving EFJSP-LW. Our proposed method can help the production managers who work with flexible manufacturing systems to obtain feasible scheduling schemes considering limited waiting time and may be useful for future research on energy-oriented scheduling problems in realistic production systems.
ArikA. O. (2021). Artificial bee colony algorithm including some components of iterated greedy algorithm for permutation flow shop scheduling problems. Neural Computing and Applications, 33, 3469–3486. https://doi.org/10.1007/s00521-020-05174-1
2.
AsadzadehL. (2016). A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Computers and Industrial Engineering, 102, 359–367. https://doi.org/10.1016/j.cie.2016.06.025
3.
BarnesJ. W.ChambersJ. B. (1996). Flexible Job Shop Scheduling By Tabu Search, Graduate Program Oper. Res. Ind. Eng. Univ. Texas At Austin, Austin, TX, USA, Rep., ORP96-09.
4.
BosmanP. A. N.ThierensD. (2003). The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE transactions on Evolutionary Computa -Tion, 7(2), 174–188. https://doi.org/10.1109/TEVC.2003.810761
5.
BrandimarteP. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41(1), 157–183. https://doi.org/10.1007/BF02023073
6.
CaldeiraR. H.GnanavelbabuA.VaidyanathanT. (2020). An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption. Computers and Industrial Engineering, 149, 106863. https://doi.org/10.1016/j.cie.2020.106863
7.
Dauzère-PérèsS.PaulliJ. (1997). An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research, 70(2), 281–306. https://doi.org/10.1023/A:1018930406487
8.
DebK.PratapA.AgarwalS.MeyarivanT. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on Evolutionary Computation, 6(2), 182–197. https://doi.org/10.1109/4235.996017
9.
DingJ. W.Dauzère-PérèsS.ShenL. J.LüZ. P. (2023). A novel evolutionary algorithm for energy-efficient scheduling in flexible job shops. IEEE transactions on Evolutionary Computation, 27(5), 1470–1484. https://doi.org/10.1109/TEVC.2022.3222791
10.
DuY.LiJ. Q.LiC. D.DuanP. Y. (2024). A reinforcement learning approach for flexible job shop scheduling problem with crane transportation and setup times. IEEE Transactions on Neural Networks and Learning Systems, 35(4), 5695–5709. https://doi.org/10.1109/TNNLS.2022.3208942
11.
DuanJ. G.WangJ. H. (2021). Energy-efficient scheduling for a flexible job shop with machine breakdowns considering machine idle time arrangement and machine speed level selection. Computers and Industrial Engineering, 161, 107677. https://doi.org/10.1016/j.cie.2021.107677
12.
DuanJ. G.WangJ. H. (2022). Robust scheduling for flexible machining job shop subject to machine breakdowns and new job arrivals considering system reusability and task recurrence. Expert Systems with Applications, 203, 117489. https://doi.org/10.1016/j.eswa.2022.117489
13.
FengY.LinY. T.YangZ. L., et al. (2024). A two-stage individual feedback NSGA-III for dynamic many-objective flexible job shop scheduling problem. IEEE Transactions on Automation Science and Engineering, 1–10. https://doi.org/10.1109/TASE.2024.3504714
14.
GaoQ. F.GuF.LiL. L.GuoJ. F. (2024). A framework of cloud-edge collaborated digital twin for flexible job shop scheduling with conflict-free routing. Robotics and Computer-Integrated Manufacturing, 86, 102672. https://doi.org/10.1016/j.rcim.2023.102672
15.
GaoK. Z.SuganthanP. N.ChuaT. J.ChongC. S.PanQ. K. (2015). A two-stage artificial bee colony algorithm scheduling flexible job shop scheduling problem with new job insertion. Expert Systems with Applications, 42(21), 7652–7663. https://doi.org/10.1016/j.eswa.2015.06.004
16.
GongG. L.ChiongR.DengQ. W.GongX. R. (2020). A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility. International Journal of Production Research, 58(14), 4406–4420. https://doi.org/10.1080/00207543.2019.1653504
17.
GongG. L.ChiongR.DengQ. W.GongX. R.LinW. H.HanW. W.ZhangL. K. (2022). A two-stage memetic algorithm for energy-efficient flexible job shop scheduling by means of decreasing the total number of machine restarts. Swarm and Evolutionary Computation, 75, 101131. https://doi.org/10.1016/j.swevo.2022.101131
18.
GongQ. S.LiJ. L.JiangZ. G.WangY. (2024b). A hierarchical integration scheduling method for flexible job shop with green lot splitting. Engineering Applications of Artificial Intelligence, 129, 107595. https://doi.org/10.1016/j.engappai.2023.107595
19.
GongG. L.TangJ. Q.HuangD.LuoQ.ZhuK. K.PengN. T. (2024a). Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility. Swarm and Evolutionary Computation, 84, 101421. https://doi.org/10.1016/j.swevo.2023.101421
20.
JiangX. Y.TianZ. Q.LiuW. J.SuoY. Q.ChenK. Q.XuX. W.LiZ. W. (2022b). Energy-efficient scheduling of flexible job shops with complex processes: A case study for the aerospace industry complex components in China. Journal of Industrial Information Integration, 27, 100293. https://doi.org/10.1016/j.jii.2021.100293
21.
JiangT. H.ZhuH. Q.LiuL.GongQ. T. (2022a). Energy-conscious flexible job shop scheduling problem considering transportation time and deterioration effect simultaneously. Sustainable Computing: Informatics and Systems, 35, 100680.
22.
KacemI.HammadiS.BorneP. (2002). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Review), 32(1), 408–419.
23.
KarabogaD.BasturkB. (2007). A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm. Journal of Global Optimization, 39, 459–471. https://doi.org/10.1007/s10898-007-9149-x
24.
Ken,D. J. (1975). An Analysis of the Behavior of a Class of Genetic Adaptive Systems, PhD Dissertation, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor.
25.
LeiD. M.LiM.WangL. (2019). A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with total energy consumption threshold. IEEE transactions on Cybernetics, 49(3), 1097–1109. https://doi.org/10.1109/TCYB.2018.2796119
26.
LeiD. M.YuanY.CaiJ. C. (2021). An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling. International Journal of Production Research, 59, 5259–5271. https://doi.org/10.1080/00207543.2020.1775911
27.
LiM.ChangC. T.LiuZ. (2024). A discrete artificial bee colony algorithm and its application in flexible flow shop scheduling with assembly and machine deterioration effect. Applied Soft Computing, 159, 111593. https://doi.org/10.1016/j.asoc.2024.111593
28.
LiJ. Q.DengJ. W.LiC. Y.HanY. Y.TianJ.ZhangB.WangC. G. (2020). An improved jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times. Knowledge-Based Systems, 200, 106032. https://doi.org/10.1016/j.knosys.2020.106032
29.
LiY. X.GuW. B.YuanM. H.TangY. M. (2022b). Real-time data-driven dynamic scheduling for flexible job shop with insufficient transportation resources using hybrid deep Q network. Robotics and Computer-Integrated Manufacturing, 74, 102283. https://doi.org/10.1016/j.rcim.2021.102283
30.
LiM.LeiD. M. (2021). An imperialist competitive algorithm with feedback for energy-efficient flexible job shop scheduling with transportation and sequence-dependent setup times. Engineering Applications of Artificial Intelligence, 103, 104307. https://doi.org/10.1016/j.engappai.2021.104307
31.
LiY. B.YangZ. P.WangL.TangH. T.SunL. B.GuoS. S. (2022a). A hybrid imperialist competitive algorithm for energy-efficient flexible job shop scheduling problem with variable-size sublots. Computers and Industrial Engineering, 172, 108641. https://doi.org/10.1016/j.cie.2022.108641
32.
LuoQ.DengQ. W.ZhuangH. N.GongG. L.FanQ.LiuX. H. (2024b). Collaborative scheduling of energy-saving spare parts manufacturing and equipment operation strategy using a self-adaptive two-stage memetic algorithm. Robotics and Computer-Integrated Manufacturing, 87, 102707. https://doi.org/10.1016/j.rcim.2023.102707
33.
LuoC.GongW. Y.LuC. (2024a). Knowledge-driven two-stage memetic algorithm for energy-efficient flexible job shop scheduling with machine breakdowns. Expert Systems with Applications, 235, 121149. https://doi.org/10.1016/j.eswa.2023.121149
34.
LvY.LiC. B.TangY.KouY. (2022). Toward energy-efficient rescheduling decision mechanisms for flexible job shop with dynamic events and alternative process plans. IEEE Transactions on Automation Science and Engineering, 19(4), 3259–3275. https://doi.org/10.1109/TASE.2021.3115821
35.
MengL. L.DuanP.GaoK. Z.ZhangB.ZouW. Q.HanY. Y.ZhangC. Y. (2024). MIP Modeling of energy-conscious FJSP and its extended problems: From simplicity to complexity. Expert Systems with Applications, 241, 122594. https://doi.org/10.1016/j.eswa.2023.122594
36.
MengL. L.ZhangC. Y.ZhangB.GaoK. Z.RenY. P.SangH. G. (2023). MILP Modeling and optimization of multi-objective flexible job shop scheduling problem with controllable processing times. Swarm and Evolutionary Computation, 82, 101374. https://doi.org/10.1016/j.swevo.2023.101374
37.
PanQ. K.WangL.LiJ. Q.DuanJ. H. (2014). A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega, 45, 42–56. https://doi.org/10.1016/j.omega.2013.12.004
38.
PanZ. X.LeiD. M.WangL. (2022). A bi-population evolutionary algorithm with feedback for energy-efficient fuzzy flexible job shop scheduling. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 52(8), 5295–5307. https://doi.org/10.1109/TSMC.2021.3120702
39.
ParkM. J.HamA. (2022). Energy-aware flexible job shop scheduling under time-of-use pricing. International Journal of Production Economics, 248, 108507. https://doi.org/10.1016/j.ijpe.2022.108507
40.
RenW. B.WenJ. Q.YanY.HuY. G.GuanY.LiJ. L. (2021). Multi-objective optimisation for energy-aware flexible job-shop scheduling problem with assembly operations. International Journal of Production Research, 59(23), 7216–7231. https://doi.org/10.1080/00207543.2020.1836421
41.
ShenL. J.Dauzère-PérèsS.MaeckerS. (2023). Energy cost efficient scheduling in flexible job-shop manufacturing systems. European Journal of Operational Research, 310, 992–1016. https://doi.org/10.1016/j.ejor.2023.03.041
42.
TianZ. Q.JiangX. Y.TianG. D.LiZ. W.LiuW. J. (2023). Knowledge-based lot-splitting optimization method for flexible job shops considering energy consumption. IEEE Transactions on Automation Science and Engineering, 1–12.
43.
WangZ. X.HeM. W.WuJ.ChenH. N.CaoY. (2024). An improved MOEA/D for low-carbon many-objective flexible job shop scheduling problem. Computers and Industrial Engineering, 188, 109926. https://doi.org/10.1016/j.cie.2024.109926
44.
WeiS. P.TangH. T.LiX. X.LeiD. M.WangX. V. (2024). An improved memetic algorithm for multi-objective resource- constrained flexible job shop inverse scheduling problem: An application for machining workshop. Journal of Manufacturing Systems, 74, 264–290. https://doi.org/10.1016/j.jmsy.2024.03.005
45.
XuG. J.BaoQ.ZhangH. L. (2023). Multi-objective green scheduling of integrated flexible job shop and automated guided vehicles. Engineering Applications of Artificial Intelligence, 126, 106864. https://doi.org/10.1016/j.engappai.2023.106864
46.
ZhangF. Y.LiR.GongW. Y. (2024a). Deep reinforcement learning-based memetic algorithm for energy-aware flexible job shop scheduling with multi-AGV. Computers and Industrial Engineering, 189, 109917. https://doi.org/10.1016/j.cie.2024.109917
47.
ZhangG. H.YanS. F.SongX. H.ZhangD. Y.GuoS. H. (2024b). Evolutionary algorithm incorporating reinforcement learning for energy-conscious flexible job-shop scheduling problem with transportation and setup times. Engineering Applications of Artificial Intelligence, 133, 107974. https://doi.org/10.1016/j.engappai.2024.107974
48.
ZhangW. K.ZhengY. F.AhmadR. (2023). An energy-efficient multi-objective integrated process planning and scheduling for a flexible job-shop-type remanufacturing system. Advanced Engineering Informatics, 56, 102010. https://doi.org/10.1016/j.aei.2023.102010
49.
ZhangY. Y.LiJ. Q.XuY.DuanP. Y. (2024c). Multi-population cooperative multi-objective evolutionary algorithm for sequence-dependent group flow shop with consistent sublots. Expert Systems with Applications, 237, 121594. https://doi.org/10.1016/j.eswa.2023.121594
50.
ZitzleE.ThieleL. (1999). Multi-objective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE transactions on Evolutionary Computation, 3(4), 257–271. https://doi.org/10.1109/4235.797969
