A genetic-simulated annealing algorithm for stochastic seru scheduling problem with deterioration and learning effect

References

• Lu YY, Jin J, Ji P, et al. Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine. Neural Comput Appl. 2016;27(7):1993–2000.
   Web of Science ®Google Scholar
• Allahverdi A, Gupta JND, Aldowaisan T. A review of scheduling research involving setup considerations. Omega (Westport). 1999;27(2):219–239.
   Web of Science ®Google Scholar
• Yin Y, Stecke KE, Swink M, et al. Lessons from seru production on manufacturing competitively in a high cost environment. J Oper Manage. 2017;49-51(1):67–76.
   Google Scholar
• Stecke KE, Kaku YY, Murase Y. Seru: the organizational extension of JIT for a super-talent factory. Int J Strategic Decis Sci. 2012;3(1):106–119.
   Google Scholar
• Zhang XL, Liu CG, Li WJ, et al. Effects of key enabling technologies for seru production on sustainable performance. Omega (Westport). 2017 January;66:290–307.
   Web of Science ®Google Scholar
• Zhang Z, Song X, Gong X, et al. An effective heuristic based on 3-opt strategy for seru scheduling problems with learning effect. Int J P Res. 2022e. DOI:10.1080/00207543.2022.2054744
   Web of Science ®Google Scholar
• Liu CG, Lian J, Yin Y, et al. Seru Seisan – an innovation of the production management mode in Japan. Asian J Technol Innovation. 2010;18(2):89–113.
   Web of Science ®Google Scholar
• Soleimani H, Ghaderi H, Tsai PW, et al. Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization. J Clean Prod. 2020;249(10):119428.
   Google Scholar
• Liu CG, Stecke KE, Lian J, et al. An implementation framework for seru production. Int Trans Oper Res. 2014;21(1):1–19.
   Web of Science ®Google Scholar
• Zhang Z, Song X, Gong X, et al. An exact quadratic programming approach based on convex reformulation for seru scheduling problems. Nav Res Logistics. 2022f;69:1096–1107.
   Web of Science ®Google Scholar
• Liu CG, Yang N, Li WJ, et al. Training and assignment of multi-skilled workers for implementing seru production systems. Int J Adv Manuf Technol. 2013;69(5–8):937–959.
   Web of Science ®Google Scholar
• Ying KC, Tsai YJ. Minimising total cost for training and assigning multiskilled workers in seru production systems. Int J P Res. 2017;55(10):2978–2989.
   Web of Science ®Google Scholar
• Yu Y, Tang SW, Kaku JF, et al. Line-seru conversion towards reducing worker(s) without increasing makespan: models, exact and meta-heuristic solutions. Int J P Res. 2017;55(10):2990–3007.
   Web of Science ®Google Scholar
• Aboelfotoh A, Süer GA, Abdullah M. Selection of assembly systems; assembly lines vs. seru systems. Procedia Comput Sci. 2018;140:351–358.
   Google Scholar
• Lian J, Liu CG, Li WJ, et al. A multi-skilled worker assignment problem in seru production systems considering the worker heterogeneity. Comput Ind Eng. 2018 April;118:366–382.
   Web of Science ®Google Scholar
• Sun W, Wu Y, Lou Q, et al. A cooperative coevolution algorithm for the seru production with minimizing makespan. IEEE Access. 2019;7:5662–5670.
   Web of Science ®Google Scholar
• Yılmaz ÖF. Operational strategies for seru production system: a bi-objective optimisation model and solution methods. Int J P Res. 2019;58(11):3195–3219.
   Web of Science ®Google Scholar
• Gai Y, Yong Y, Tang JF, Liu S Q. 2020 . Minimizing makespan of a production batch within concurrent systems: seru production perspective. J Manage Sci Eng 7(1)1–18.
   Google Scholar
• Yılmaz ÖF. Attaining flexibility in seru production system by means of Shojinka: an optimization model and solution approaches. Comput Oper Res. 2020 July;11:104917.
   Google Scholar
• Liu C, Li Z, Tang JF, et al. How SERU production system improves manufacturing flexibility and firm performance: an empirical study in China. Ann Oper Res. 2021. DOI:10.1007/S10479-202-03850-Y
   Web of Science ®Google Scholar
• Liu F, Niu B, Xing MZ, et al. Optimal cross-trained worker assignment for a hybrid seru production system to minimize makespan and workload imbalance. Comput Ind Eng. 2021 October;160:107552.
   Web of Science ®Google Scholar
• Luo L, Zhang Z, Yin Y. Simulated annealing and genetic algorithm based method for a bi-level seru loading problem with worker assignment in seru production system. J Ind Manage Optim. 2021;17(2):779–803.
   Google Scholar
• Zhang Z, Han X, Song X, et al. Evaluate the reliability of a seru production system with reworking actions. J Ind Prod Eng. 2021;38(7):475–484.
   Web of Science ®Google Scholar
• Zhang Z, Gong X, Song X, et al. A column generation-based exact solution method for seru scheduling problems. Omega (Westport). 2022a;108:102581.
   Web of Science ®Google Scholar
• Zhang Z, Song X, Huang H, et al. Scheduling problem in seru production system considering DeJong’s learning effect and job splitting. Ann Oper Res. 2022b;312:1119–1141.
   Web of Science ®Google Scholar
• Zhang Z, Song X, Huang H, et al. Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect. Eur J Oper Res. 2022c;297:866–877.
   Web of Science ®Google Scholar
• Yu Y, Tang JF. Review of seru production. Front Eng Manage. 2019;6(2):183–192.
   Web of Science ®Google Scholar
• Wang JB. A note on scheduling problems with learning effect and deteriorating jobs. Int J Soc Syst Sci. 2006;37(12):827–833.
   Google Scholar
• Ji M, Tang XY, Zhang X, et al. Machine scheduling with deteriorating jobs and DeJong’s learning effect. Comput Ind Eng. January;91:42–47.
   Web of Science ®Google Scholar
• Azadeh A, Goodarzi AH, Kolaee MH, et al. An efficient simulation–neural network–genetic algorithm for flexible flow shops with sequence-dependent setup times, job deterioration and learning effects. Neural Comput Appl. 2019;31(9):5327–5341.
   Web of Science ®Google Scholar
• Shen J. Uncertain Single-Machine Scheduling with Deterioration and Learning Effect. J Math. 2020;2020:10.
   Web of Science ®Google Scholar
• Li K, Chen JF, Fu H, et al. Parallel machine scheduling with position-based deterioration and learning effects in an uncertain manufacturing system. Comput Ind Eng. 2020 November;149:106858.
   Web of Science ®Google Scholar
• Sun L, Yu A, Wu B. Single machine common flow allowance group scheduling with learning effect and resource allocation. Comput Ind Eng. 2020 January;139:106126.
   Web of Science ®Google Scholar
• Gu JW, Gu XH, Gu MZ. A novel parallel quantum genetic algorithm for stochastic job shop scheduling. J Math Anal Appl. 2009;355(1):63–81.
   Web of Science ®Google Scholar
• Juan A, Barrios B, Riera VE, et al. A sim heuristic algorithm for solving the permutation flow shop problem with stochastic processing times. Simul Modell Pract Theory. 2014 August;46:101–117.
   Web of Science ®Google Scholar
• Gonzalez-Neira EM, Ferone D, Hatami S, et al. A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times. Simul Modell Pract Theory. 2017 December;79:23–36.
   Web of Science ®Google Scholar
• Caldeira RH, Gnanavelbabu A. A simheuristic approach for the flexible job shop scheduling problem with stochastic processing times. SIMULATION. 2021;97(3):215–236.
   Google Scholar
• Giulia B, Dario A, Dorota S. Evaluating the effect of learning rate, batch size and assignment strategies on the production performance. J Ind Prod Eng. 2021;38(2):137–147.
   Web of Science ®Google Scholar
• Yue Q, Zhou SH. Due-window assignment scheduling problem with stochastic processing times. Eur J Oper Res. 2021;290(2):453–468.
   Web of Science ®Google Scholar
• Zhu Z, Chu F, Sun L, et al. Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity. Appl Math Modell. 2013;37(7):5371–5380.
   Web of Science ®Google Scholar
• Wu L, Cheng CD. On single machine scheduling with resource constraint. J Comb Optim. 2016;31(2):491–505.
   Web of Science ®Google Scholar
• Afzalirad M, Rezaeian J. Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Comput Ind Eng. 2016 August;98:40–52.
   Web of Science ®Google Scholar
• Fanjul-Peyro L, Perea F, Ruiz R. Models and matheuristicsmetaheuristics for the unrelated parallel machine scheduling problem with additional resources. Eur J Oper Res. 2017;260(2):482–493.
   Web of Science ®Google Scholar
• Costa A, Fernandez-Viagas V, Framinan JM. Solving the hybrid flow shop scheduling problem with limited human resource constraint. Comput Ind Eng. 2020 August;146:106545.
   Web of Science ®Google Scholar
• Prata B, Abreu L, Lima J. Heuristic methods for the single-machine scheduling problem with periodical resource constraints. TOP. 2021 July;29:524–546.
   Web of Science ®Google Scholar
• Tao X, Li J, Han Y, et al. Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem. J Ind Prod Eng. 2020;37(7):345–359.
   Web of Science ®Google Scholar
• Liu HR, Qu SJ, Li RJ, et al. Bi-objective robust project scheduling with resource constraints and flexible activity execution lists. Comput Ind Eng. 2021 June;156:107288.
   Web of Science ®Google Scholar
• Allahverdi AN, Cheng T, C. E T, et al. 0A survey of scheduling problems with setup times or costs. Eur J Oper Res. 2008;187(3):985–1032.
   Web of Science ®Google Scholar
• Allahverdi A. The third comprehensive survey on scheduling problems with setup times/costs. Eur J Oper Res. 2015;246(2):345–378.
   Web of Science ®Google Scholar
• Hsu CJ, Kuo WH, Yang DL. Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects. Appl Math Modell. 2010;35(3):1492–1496.
   Web of Science ®Google Scholar
• Kim JG, Song S, Jeong BJ. Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times. Int J P Res. 2020;58(6):1628–1643.
   Web of Science ®Google Scholar
• Zhang GH, Hu YF, Sun JH, et al An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm Evol Comput. 2020 May;54:100664.
   Web of Science ®Google Scholar
• Rifai AP, Mara STW, Sudiarso A. Multi-objective distributed reentrant permutation flow shop scheduling with sequence-dependent setup time. Expert Syst Appl. 2021;183(30):115339.
   Google Scholar
• Raka J, Stefan V. Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl Soft Comput. 2021;110:107521.
   Web of Science ®Google Scholar
• Jiang YJ, Zhang Z, Gong X, et al An exact solution method for solving seruscheduling problems with past-sequence-dependent setup time and learning effect. Comput Ind Eng. 2021 August;158:107354.
   Web of Science ®Google Scholar
• Bui KV, Nguyen VH. ‘Genetic algorithm with initial sequence for parallel machines scheduling with sequence dependent setup times based on earliness- tardiness. J Ind Prod Eng. 2021;38(1):18–28.
   Web of Science ®Google Scholar
• Chen PH, Shahandashti SM. Hybrid of genetic algorithm and simulated annealing for multiple project scheduling with multiple resource constraints. Autom Constr. 2008;18(4):434–443.
   Web of Science ®Google Scholar
• Dai M, Tang DB, Giret A, et al. Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robot Comput Integr Manuf. 2013;29(5):418–429.
   Web of Science ®Google Scholar
• Yang MS, Ba L, Liu Y, et al. An Improved Genetic Simulated Annealing Algorithm for Stochastic Two-Sided Assembly Line Balancing Problem. Int J Simul Model. 2019;18(1):175–186.
   Web of Science ®Google Scholar
• Wang K, Li X, Gao L, et al. A genetic simulated annealing algorithm for parallel partial disassembly line balancing problem. Appl Soft Comput J. 2021 August;107:107404.
   Web of Science ®Google Scholar
• Xuan H, Zheng Q, Li B, et al. A novel genetic simulated annealing algorithm for no-wait hybrid flowshop problem with unrelated parallel machines. Control and System Engineering, ISIJ Int. 2021;61(1):258–268.
   Google Scholar
• Zhang Z, Wang L, Song XL, et al. Improved genetic-simulated annealing algorithm for seru loading problem with downward substitution under stochastic environment. J Oper Res Soc. 2022d;73(8):1800–1811.
   Web of Science ®Google Scholar
• Shen L, Zhang Z, Yin Y. An improved genetic algorithm for seru scheduling problem with worker assignment considering lot-splitting. Int J Appl Decis Sci. 2021;14(6):710–730.
   Google Scholar
• Zhang Z, Shao L, Yin Y. PSO-based algorithm for solving lot splitting in unbalanced seru production system. Int J Ind Syst Eng. 2020;35(4):433–450.
   Google Scholar