REFERENCES
1. Liu J, Wang S. Balancing disassembly line in product recovery to promote the coordinated development of economy and environment. Sustainability 2017;9:309.
2. Gungor A, Gupta SM. Issues in environmentally conscious manufacturing and product recovery: a survey. Comput Ind Eng 1999;36:811-53.
3. Özceylan E, Kalayci CB, Güngör A, Gupta SM. Disassembly line balancing problem: a review of the state of the art and future directions. Int J Prod Res 2019;57:4805-27.
4. Paterson DAP, Ijomah WL, Windmill JFC. End-of-life decision tool with emphasis on remanufacturing. J Clean Prod 2017;148:653-64.
6. Fu Y, Zhou M, Guo X, Qi L, Sedraoui K. Multiverse optimization algorithm for stochastic biobjective disassembly sequence planning subject to operation failures. IEEE Trans Syst Man Cybern Syst 2022;52:1041-51.
8. Kalayci CB, Gupta SM. Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem. Expert Syst Appl 2013;40:7231-41.
9. Edis EB. Constraint programming approaches to disassembly line balancing problem with sequencing decisions. Comput Oper Res 2021;126:105111.
10. ÇİL ZA. An exact solution method for multi-manned disassembly line design with AND/OR precedence relations. Appl Math Model 2021;99:785-803.
11. Meng L, Zhang B, Ren Y, Sang H, Gao K, Zhang C. Mathematical formulations for asynchronous parallel disassembly planning of end-of-life products. Mathematics 2022;10:3854.
12. Bentaha ML, Battaïa O, Dolgui A. An exact solution approach for disassembly line balancing problem under uncertainty of the task processing times. Int J Prod Res 2015;53:1807-18.
13. Altekin FT, Akkan C. Task-failure-driven rebalancing of disassembly lines. Int J Prod Res 2012;50:4955-76.
14. He J, Chu F, Dolgui A, Zheng F, Liu M. Integrated stochastic disassembly line balancing and planning problem with machine specificity. Int J Prod Res 2022;60:1688-708.
15. McGovern SM, Gupta SM. Uninformed and probabilistic distributed agent combinatorial searches for the unary NP-complete disassembly line balancing problem. In: Proceedings Volume Environmentally Conscious Manufacturing V. 2005.
16. Chen M, Tan Y. SF-FWA: a self-adaptive fast fireworks algorithm for effective large-scale optimization. Swarm Evol Comput 2023;80:101314.
17. Singh P, Pasha J, Moses R, Sobanjo J, Ozguven EE, Dulebenets MA. Development of exact and heuristic optimization methods for safety improvement projects at level crossings under conflicting objectives. Reliab Eng Syst Saf 2022;220:108296.
18. Pasha J, Nwodu AL, Fathollahi-fard AM, et al. Exact and metaheuristic algorithms for the vehicle routing problem with a factory-in-a-box in multi-objective settings. Adv Eng Inform 2022;52:101623.
19. Singh E, Pillay N. A study of ant-based pheromone spaces for generation constructive hyper-heuristics. Swarm Evol Comput 2022;72:101095.
20. Fu Y, Ma X, Gao K, Li Z, Dong H. Multi-objective home health care routing and scheduling with sharing service via a problem-specific knowledge-based artificial bee colony algorithm. IEEE Trans Intell Transport Syst 2023:1-14.
21. Fu Y, Tian G, Li Z, Wang Z. Parallel machine scheduling with dynamic resource allocation via a master-slave genetic algorithm. IEEJ Trans Electr Electron Eng 2018;13:748-56.
22. Fu Y, Wang H, Huang M, Wang J. A decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy for flowshop scheduling problem. Nat Comput 2019;18:757-68.
23. Ma X, Fu Y, Gao K, Zhu L, Sadollah A. A multi-objective scheduling and routing problem for home health care services via brain storm optimization. Complex Syst Model Simul 2023;3:32-46.
24. Liang P, Fu Y, Ni S, Zheng B. Modeling and optimization for noise-aversion and energy-awareness disassembly sequence planning problems in reverse supply chain. Environ Sci Pollut Res Int 2021.
25. Wang Y, Han Y, Wang Y, Li J, Gao K, Liu Y. An effective two-stage iterated greedy algorithm for distributed flowshop group scheduling problem with setup time. Expert Syst Appl 2023;233:120909.
26. Wang Y, Han Y, Wang Y, Tasgetiren MF, Li J, Gao K. Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem. Eur J Oper Res 2023;311:816-32.
27. Wang Y, Han Y, Wang Y, Pan Q, Wang L. Sustainable scheduling of distributed flow shop group: a collaborative multi-objective evolutionary algorithm driven by indicators. IEEE Trans Evol Comput 2023.
28. Chen S, Pan QK, Gao L, Sang H. A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem. Eng Appl Artif Intell 2021;104:104375.
29. Huang YY, Pan QK, Gao L, Miao ZH, Peng C. A two-phase evolutionary algorithm for multi-objective distributed assembly permutation flowshop scheduling problem. Swarm Evol Comput 2022;74:101128.
30. Wang ZY, Pan QK, Gao L, Wang YL. An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem. Swarm Evol Comput 2022;74:101143.
31. Kalayci CB, Gupta SM. A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem. Int J Adv Manuf Technol 2013;69:197-209.
32. Tseng YJ, Yu FY, Huang FY. A green assembly sequence planning model with a closed-loop assembly and disassembly sequence planning using a particle swarm optimization method. Int J Adv Manuf Technol 2011;57:1183-97.
33. Bouazza S, Hassine H, Barkallah M, Amari S, Haddar M. Disassembly sequence optimization for profit and energy consumption using petri nets and particle swarm optimization. In: Ben Amar M, Bouguecha A, Ghorbel E, El Mahi A, Chaari F, Haddar M, editors. Advances in materials, mechanics and manufacturing II. Cham: Springer International Publishing; 2022. pp. 267-76.
34. Yeh WC. Optimization of the disassembly sequencing problem on the basis of self-adaptive simplified swarm optimization. IEEE Trans Syst Man Cybern A 2012;42:250-61.
35. Yeh WC. Simplified swarm optimization in disassembly sequencing problems with learning effects. Comput Oper Res 2012;39:2168-77.
36. Li WD, Xia K, Gao L, Chao KM. Selective disassembly planning for waste electrical and electronic equipment with case studies on liquid crystaldisplays. Robot Comput Integr Manuf 2013;29:248-60.
37. Wang K, Li X, Gao L, Li P, Sutherland JW. A discrete artificial bee colony algorithm for multiobjective disassembly line balancing of end-of-life products. IEEE Trans Cybern 2022;52:7415-26.
38. Guo H, Zhang L, Ren Y, Li Y, Zhou Z, Wu J. Optimizing a stochastic disassembly line balancing problem with task failure via a hybrid variable neighborhood descent-artificial bee colony algorithm. Int J Prod Res 2023;61:2307-21.
39. Zhang L, Wu Y, Zhao X, et al. A multi-objective two-sided disassembly line balancing optimization based on artificial bee colony algorithm: a case study of an automotive engine. Int J Pr Eng Man GT 2022;9:1329-47.
40. Ren Y, Gao K, Fu Y, Sang H, Li D, Luo Z. A novel Q-learning based variable neighborhood iterative search algorithm for solving disassembly line scheduling problems. Swarm Evol Comput 2023;80:101338.
41. Slama I, Ben-Ammar O, Dolgui A, Masmoudi F. Genetic algorithm and Monte Carlo simulation for a stochastic capacitated disassembly lot-sizing problem under random lead times. Comput Ind Eng 2021;159:107468.
42. Wu T, Zhang Z, Zeng Y, Zhang Y. Mixed-integer programming model and hybrid local search genetic algorithm for human-robot collaborative disassembly line balancing problem. Int J Prod Res 2023;62:1758-82.
43. Tseng HE, Chang CC, Lee SC, Huang YM. A block-based genetic algorithm for disassembly sequence planning. Expert Syst Appl 2018;96:492-505.
44. Go TF, Wahab DA, Rahman MNA, Ramli R, Hussain A. Genetically optimised disassembly sequence for automotive component reuse. Expert Syst Appl 2012;39:5409-17.
45. Alshibli M, El Sayed A, Kongar E, Sobh TM, Gupta SM. Disassembly sequencing using tabu search. J Intell Robot Syst 2016;82:69-79.
46. Wang K, Li X, Gao L, Li P, Gupta SM. A genetic simulated annealing algorithm for parallel partial disassembly line balancing problem. Appl Soft Comput 2021;107:107404.
47. Kalayci CB, Polat O, Gupta SM. A variable neighbourhood search algorithm for disassembly lines. J Manuf Technol Manag 2015;26:182-94.
48. Ren Y, Zhang C, Zhao F, Triebe MJ, Meng L. An MCDM-based multiobjective general variable neighborhood search approach for disassembly line balancing problem. IEEE Trans Syst Man Cybern Syst 2020;50:3770-83.
49. Akbay MA, Kalayci CB, Polat O. A parallel variable neighborhood search algorithm with quadratic programming for cardinality constrained portfolio optimization. Knowl Based Syst 2020;198:105944.
50. Liu H, Zhang L. Optimizing a disassembly sequence planning with success rates of disassembly operations via a variable neighborhood search algorithm. IEEE Access 2021;9:157540-9.
51. Tuncel E, Zeid A, Kamarthi S. Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning. J Intell Manuf 2014;25:647-59.
52. Zhao X, Li C, Tang Y, Cui J. Reinforcement learning-based selective disassembly sequence planning for the end-of-life products with structure uncertainty. IEEE Robot Autom Lett 2021;6:7807-14.
53. Zhao F, Hu X, Wang L, Zhao J, Tang J, Jonrinaldi. A reinforcement learning brain storm optimization algorithm (BSO) with learning mechanism. Knowl Based Syst 2022;235:107645.
54. Karimi-Mamaghan M, Mohammadi M, Pasdeloup B, Meyer P. Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 2023;304:1296-330.
55. Wang L, Gao K, Lin Z, Huang W, Suganthan PN. Problem feature based meta-heuristics with Q-learning for solving urban traffic light scheduling problems. Appl Soft Comput 2023;147:110714.
56. Lin Z, Gao K, Wu N, Suganthan PN. Scheduling eight-phase urban traffic light problems via ensemble meta-heuristics and Q-learning based local search. IEEE Trans Intell Transport Syst 2023;24:14415-26.
57. Yu H, Gao KZ, Ma ZF, Pan YX. Improved meta-heuristics with Q-learning for solving distributed assembly permutation flowshop scheduling problems. Swarm Evol Comput 2023;80:101335.
58. Rummery GA, Niranjan M. On-line Q-learning using connectionist systems. Available from: https://www.researchgate.net/publication/2500611_On-Line_Q-Learning_Using_Connectionist_Systems. [Last accessed on 24 Jan 2024].
59. Li D, Gao K, Ren Y, Zhang R, Fu Y. The supplementary file of the paper “Integrating meta-heuristics and a Sarsa algorithm for disassembly scheduling problems with cycle time and hazard coefficients”. Available from: https://www.researchgate.net/publication/377446410_The_supplementary_file_of_the_paper_Integrating_Metaheuristics_and_a_Sarsa_Algorithm_for_Disassembly_Scheduling_Problems_with_Cycle_Time_and_Hazard_Coefficients. [Last accessed on 24 Jan 2024].
60. Li H, Gao K, Duan PY, Li JQ, Zhang L. An improved artificial bee colony algorithm with Q-learning for solving permutation flow-shop scheduling problems. IEEE Trans Syst Man Cybern Syst 2023;53:2684-93.
61. Zhang Z, Liu H, Zhou M, Wang J. Solving dynamic traveling salesman problems with deep reinforcement learning. IEEE Trans Neural Netw Learn Syst 2023;34:2119-32.
