An ameliorated discrete teaching-learning-based optimization algorithm for fuzzy flexible job shop scheduling with dynamic AGV coordination in mold manufacturing
Restricted accessResearch articleFirst published online 2026
An ameliorated discrete teaching-learning-based optimization algorithm for fuzzy flexible job shop scheduling with dynamic AGV coordination in mold manufacturing
Mold manufacturing is of vital importance in industrial production. The production planning and scheduling for molds have a significant impact on production efficiency and the competitiveness of enterprises. This study delves into fFJSPa, the fuzzy flexible job shop scheduling problem in mold manufacturing, where automated guided vehicle (AGV) constraints are considered. A rigorous mathematical model is formulated for fFJSPa, employing triangular fuzzy numbers to characterize uncertainties in both processing and transportation times, with the objective of minimizing the fuzzy makespan. To solve this complex problem, an ameliorated discrete teaching-learning-based optimization (ADTLBO) algorithm is proposed. ADTLBO enhances the balance between exploration and exploitation through stochastic integration of discrete crossover operators, historical population archives, self-feedback learning, and backtracking learning mechanisms. Comprehensive experiments on fFJSPa test case demonstrate that ADTLBO significantly outperforms other17 algorithms in optimal fuzzy completion time, worst fuzzy completion time, average fuzzy completion time, and mean certain completion time, particularly in large-scale scenarios. Although computational time is marginally higher in specific cases, ADTLBO delivers robust efficacy in resolving intricate fFJSPa instances, thereby providing a reliable and practical decision-support framework for intelligent production scheduling in mold manufacturing environments.
JongWRChenHTLinYH, et al. The multi-layered job-shop automatic scheduling system of mould manufacturing for Industry 3.5. Comput Ind Eng2020; 149: 106797.
2.
GanPYLeeKS. Scheduling of flexible-sequenced process plans in a mould manufacturing shop. Int J Adv Manuf Technol2002; 20: 214–222.
3.
ChoyKLLeungYKChowHKH, et al. A hybrid scheduling decision support model for minimizing job tardiness in a make-to-order based mould manufacturing environment. Expert Syst Appl2011; 38: 1931–1941.
4.
GonçalvesJFde Magalhães MendesJJResendeMGC. A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res2005; 167: 77–95.
5.
Dauzère-PérèsSDingJShenL, et al. The flexible job shop scheduling problem: a review. Eur J Oper Res2024; 314: 409–432.
6.
ChaudhryIAKhanAA. A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res2016; 23: 551–591.
7.
XieJGaoLPengK, et al. Review on flexible job shop scheduling. IET Collab Intell Manuf2019; 1: 67–77.
8.
HollandJ. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press, 1992.
9.
RaoRVSavsaniVJVakhariaDP. Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des2011; 43: 303–315.
10.
RaoRVSavsaniVJVakhariaDP. Teaching–Learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci2012; 183(1): 1–15.
11.
CiviciogluP. Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput2013; 219: 8121–8144.
12.
StornRPriceK. Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim1997; 11: 341–359.
13.
BrestJGreinerSBoskovicB, et al. Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems. IEEE Trans Evol Comput2006; 10: 646–657.
14.
MirjaliliSMirjaliliSMLewisA. Grey wolf optimizer. Adv Eng Softw2014; 69: 46–61.
15.
GandomiAHAlaviAH. Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul2012; 17: 4831–4845.
16.
BansalJCSharmaHJadonSS. Artificial bee colony algorithm: a survey. Int J Adv Intell Paradig2013; 5(1-2): 123–159.
17.
MirjaliliS. SCA: a sine cosine algorithm for solving optimization problems. Knowledge Based Syst2016; 96: 120–133.
SimonD. Biogeography-based optimization. IEEE Trans Evol Comput2008; 12: 702–713.
20.
MirjaliliS. The ant lion optimizer. Adv Eng Softw2015; 83: 80–98.
21.
KarabogaDAkayB. A comparative study of artificial bee colony algorithm. Appl Math Comput2009; 214: 108–132.
22.
EusuffMMLanseyKE. Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plan Manag2003; 129: 210–225.
23.
RashediENezamabadi-pourHSaryazdiS. GSA: a gravitational search algorithm. Inf Sci2009; 179: 2232–2248.
24.
MirjaliliSGandomiAH. Chaotic gravitational constants for the gravitational search algorithm. Appl Soft Comput2017; 53: 407–419.
25.
ZhangGGaoLShiY. An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl2011; 38: 3563–3573.
26.
HanXChengWMengL, et al. A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV. Swarm Evol Comput2024; 86: 101538.
27.
YaoYLiuQFuL, et al. A novel mathematical model for the flexible job-shop scheduling problem with limited automated guided vehicles. IEEE Trans Autom Sci Eng2024; 21(4): 4166–4179.
28.
GuoHLiuJWangY, et al. An improved genetic programming hyper-heuristic for the dynamic flexible job shop scheduling problem with reconfigurable manufacturing cells. J Manuf Syst2024; 74: 252–263.
29.
XuYZhangMYangM, et al. Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem. J Manuf Syst2024; 73: 334–348.
30.
PezzellaFMorgantiGCiaschettiG. A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res2008; 35: 3202–3212.
31.
GaoJSunLGenM. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res2008; 35: 2892–2907.
32.
BaykasogluA. Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. Int J Prod Res2002; 40: 4523–4543.
33.
HuSZengJZhangX, et al. Joint decision-making on production scheduling and roll change planning in hot rolling process with roll profile constraints. Proc Inst Mech Eng B J Eng Manuf2026; 240: 09544054251408542.
34.
ChoYKimH-IKimY-R, et al. A scheduling mechanism for hybrid flow shops with reworks under general queue time limits. Proc Inst Mech Eng B J Eng Manuf2024; 238: 962–970.
35.
TianJZhouXLengJ, et al. A batch scheduling method for multi-production line hybrid flow shop integrating genetic algorithm and deep reinforcement learning. Proc Inst Mech Eng B J Eng Manuf2025; 239: 09544054251400818.
36.
RenXZhaoN. Dynamic scheduling of human-machine collaborative flexible job shops based on deep reinforcement learning. Proc Inst Mech Eng B J Eng Manuf2026; 239: 09544054251406569.
37.
GanXZuoYYangG, et al. Dynamic scheduling for dual-objective job shop with machine breakdown by reinforcement learning. Proc Inst Mech Eng B J Eng Manuf2024; 238: 3–17.
38.
CaiZSunMYanT, et al. An enhanced teaching–learning-based optimization for the flexible job shop scheduling problem considering worker behaviours. Soft Comput2024; 28: 9521–9545.
39.
BuddalaRMahapatraSS. An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method. J Ind Eng Int2019; 15: 181–192.
40.
BuddalaRMahapatraSSinghM, et al. Improved TLBO and JAYA algorithms to solve new fuzzy flexible job-shop scheduling problems. J Ind Eng Int2022; 18: 102–114.
41.
JinLZhangCWenX, et al. A neutrosophic set-based TLBO algorithm for the flexible job-shop scheduling problem with routing flexibility and uncertain processing times. Complex Intell Syst2021; 7: 2833–2853.
42.
BortolanGDeganiR. A review of some methods for ranking fuzzy subsets. Fuzzy Sets Syst1985; 15(1): 1–19.
43.
LinJ. A hybrid biogeography-based optimization for the fuzzy flexible job-shop scheduling problem. Knowl Based Syst2015; 78: 59–74.
44.
WangCTianNJiZ, et al. Multi-objective fuzzy flexible job shop scheduling using memetic algorithm. J Stat Comput Simul2017; 87: 2828–2846.
45.
SakawaMKubotaR. Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms. Eur J Oper Res2000; 120: 393–407.
46.
ZhouJYeHJiX, et al. An improved backtracking search algorithm for casting heat treatment charge plan problem. J Intell Manuf2019; 30: 1335–1350.
47.
WuBZhouJJiX, et al. An ameliorated teaching–learning-based optimization algorithm based study of image segmentation for multilevel thresholding using Kapur’s entropy and Otsu’s between class variance. Inf Sci2020; 533: 72–107.
48.
DerOTasciMBasarG, et al. Intelligent modeling and prediction of CO2 laser cutting performance in FFF-printed thermoplastics using machine learning algorithms. Proc Inst Mech Eng E J Process Mech Eng2025; 239: 09544089251366429.
49.
DerO. Multi-output prediction and optimization of CO2 laser cutting quality in FFF-printed ASA thermoplastics using machine learning approaches. Polymers2025; 17: 1910.
50.
JiXYeHZhouJ, et al. An improved teaching-learning-based optimization algorithm and its application to a combinatorial optimization problem in foundry industry. Appl Soft Comput2017; 57: 504–516.
51.
LeiD. A genetic algorithm for flexible job shop scheduling with fuzzy processing time. Int J Prod Res2010; 48: 2995–3013.
52.
LeiD. Scheduling fuzzy job shop with preventive maintenance through swarm-based neighborhood search. Int J Adv Manuf Technol2011; 54: 1121–1128.
53.
LiXGaoL. An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ2016; 174: 93–110.
54.
BierwirthCMattfeldDKopferH. On permutation representations for scheduling problems. In: International conference on parallel problem solving from nature, 1996, pp.310–318. Springer.
55.
BrandimarteP. Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res1993; 41: 157–183.
