{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T15:54:18Z","timestamp":1783958058168,"version":"3.55.0"},"reference-count":53,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52275489"],"award-info":[{"award-number":["52275489"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21B2029"],"award-info":[{"award-number":["U21B2029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52205522"],"award-info":[{"award-number":["52205522"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Robotics and Computer-Integrated Manufacturing"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.rcim.2026.103246","type":"journal-article","created":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T17:22:21Z","timestamp":1769188941000},"page":"103246","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Adaptive active decoding and novel disjunctive graph-based improved genetic algorithm for multi-type machine robot cell scheduling in mass customization"],"prefix":"10.1016","volume":"100","author":[{"given":"Yue","family":"Teng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianhong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2284-7291","authenticated-orcid":false,"given":"Chunjiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziyue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiming","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.rcim.2026.103246_bib0001","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.rcim.2025.103015","article-title":"Demand-driven hierarchical integrated planning-scheduling control for a mobile robot-operated flexible smart manufacturing system [J]","volume":"95","author":"Li","year":"2025","journal-title":"Robot Comput.-Integr. Manuf."},{"issue":"4","key":"10.1016\/j.rcim.2026.103246_bib0002","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1007\/s10845-021-01883-z","article-title":"A smart system in manufacturing with mass personalization (S-MMP) for blueprint and scenario driven by industrial model transformation [J]","volume":"34","author":"Zhang","year":"2023","journal-title":"J. Intell. Manuf."},{"issue":"11","key":"10.1016\/j.rcim.2026.103246_bib0003","doi-asserted-by":"crossref","first-page":"8729","DOI":"10.1109\/TSMC.2025.3612300","article-title":"Graph-based dual-agent deep reinforcement learning for dynamic Human-machine hybrid reconfiguration manufacturing scheduling [J]","volume":"55","author":"Li","year":"2025","journal-title":"IEEE Trans. Syst. Man Cybern. -Syst."},{"key":"10.1016\/j.rcim.2026.103246_bib0004","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.rcim.2025.103047","article-title":"Joint optimization of production scheduling and worker allocation under a resource dedication policy in aircraft assembly lines [J]","volume":"96","author":"Zheng","year":"2025","journal-title":"Robot Comput.-Integr. Manuf."},{"key":"10.1016\/j.rcim.2026.103246_bib0005","first-page":"15","article-title":"An efficient and stable intelligent scheduling algorithm based on hybrid neighbourhood structure for flexible job shop scheduling problem benchmarks [J]","author":"Xie","year":"2025","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.rcim.2026.103246_bib0006","doi-asserted-by":"crossref","DOI":"10.1038\/s44334-025-00061-w","article-title":"Leveraging large language models for efficient scheduling in Human\u2013Robot collaborative flexible manufacturing systems [J]","volume":"2","author":"Huang","year":"2025","journal-title":"npj Adv. Manuf."},{"issue":"4","key":"10.1016\/j.rcim.2026.103246_bib0007","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/s11465-019-0560-z","article-title":"Energy-aware fuzzy job-shop scheduling for engine remanufacturing at the multi-machine level [J]","volume":"14","author":"Zhao","year":"2019","journal-title":"Front. Mech. Eng."},{"key":"10.1016\/j.rcim.2026.103246_bib0008","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.asoc.2016.10.008","article-title":"Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times [J]","volume":"52","author":"Zhou","year":"2017","journal-title":"Appl. Soft. Comput."},{"issue":"1","key":"10.1016\/j.rcim.2026.103246_bib0009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","article-title":"A survey of scheduling with parallel batch (p-batch) processing [J]","volume":"298","author":"Fowler","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.rcim.2026.103246_bib0010","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cie.2016.11.001","article-title":"Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches [J]","volume":"102","author":"Ham","year":"2016","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"10.1016\/j.rcim.2026.103246_bib0011","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s11465-024-0809-z","article-title":"Comprehensive performance improvement of a water hydraulic high-speed on\/off valve for underwater hydraulic manipulators using a multi-objective optimization method [J]","volume":"19","author":"Meng","year":"2024","journal-title":"Front. Mech. Eng."},{"key":"10.1016\/j.rcim.2026.103246_bib0012","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.swevo.2024.101544","article-title":"A DQN-based memetic algorithm for energy-efficient job shop scheduling problem with integrated limited AGVs [J]","volume":"87","author":"Yao","year":"2024","journal-title":"Swarm. Evol. Comput."},{"issue":"4","key":"10.1016\/j.rcim.2026.103246_bib0013","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","article-title":"Job-shop scheduling with multi-purpose machines [J]","volume":"45","author":"Brucker","year":"1990","journal-title":"Computing"},{"issue":"3","key":"10.1016\/j.rcim.2026.103246_bib0014","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","article-title":"Mathematical modeling and heuristic approaches to flexible job shop scheduling problems [J]","volume":"18","author":"Fattahi","year":"2007","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.rcim.2026.103246_bib0015","series-title":"Flexible Job Shop Scheduling by Tabu Search [J]","author":"Chambers","year":"1998"},{"issue":"7","key":"10.1016\/j.rcim.2026.103246_bib0016","doi-asserted-by":"crossref","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","article-title":"A hybrid harmony search algorithm for the flexible job shop scheduling problem [J]","volume":"13","author":"Yuan","year":"2013","journal-title":"Appl. Soft. Comput."},{"key":"10.1016\/j.rcim.2026.103246_bib0017","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem [J]","volume":"174","author":"Li","year":"2016","journal-title":"Int. J. Prod. Econ."},{"issue":"18","key":"10.1016\/j.rcim.2026.103246_bib0018","doi-asserted-by":"crossref","first-page":"32","DOI":"10.3390\/s20185440","article-title":"A modified genetic algorithm with local search strategies and multi-crossover operator for job shop scheduling problem [J]","volume":"20","author":"Viana","year":"2020","journal-title":"Sensors"},{"key":"10.1016\/j.rcim.2026.103246_bib0019","first-page":"31","article-title":"A multi-critical-path co-driven evolutionary algorithm addressing the dual-resource flexible job shop scheduling problem with offline operations and job priority constraints [J]","author":"Zhang","year":"2025","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.rcim.2026.103246_bib0020","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.aei.2025.104250","article-title":"Gini population diversity-guided optimization for flexible job-Shop scheduling in discrete manufacturing systems [J]","volume":"71","author":"Li","year":"2026","journal-title":"Adv. Eng. Inform."},{"issue":"2","key":"10.1016\/j.rcim.2026.103246_bib0021","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","article-title":"Efficient scheduling algorithms for a single batch processing machine [J]","volume":"5","author":"Ikura","year":"1986","journal-title":"Oper. Res. Lett."},{"issue":"7","key":"10.1016\/j.rcim.2026.103246_bib0022","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","article-title":"Scheduling a single batch processing machine with non-identical job sizes [J]","volume":"32","author":"Uzsoy","year":"1994","journal-title":"Int. J. Prod. Res."},{"issue":"7","key":"10.1016\/j.rcim.2026.103246_bib0023","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/S0305-0548(00)00078-2","article-title":"Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure [J]","volume":"29","author":"Dupont","year":"2002","journal-title":"Comput. Oper. Res."},{"issue":"3-4","key":"10.1016\/j.rcim.2026.103246_bib0024","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/s00170-005-0194-7","article-title":"A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem [J]","volume":"31","author":"Chou","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"22","key":"10.1016\/j.rcim.2026.103246_bib0025","doi-asserted-by":"crossref","first-page":"7031","DOI":"10.1080\/00207543.2018.1424371","article-title":"Modelling and symmetry breaking in scheduling problems on batch processing machines [J]","volume":"56","author":"Trindade","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.rcim.2026.103246_bib0026","first-page":"20","article-title":"Multi-agent deep reinforcement learning for dynamic reconfigurable shop scheduling considering batch processing and worker cooperation [J]","volume":"91","author":"Li Y X","year":"2025","journal-title":"Robot Comput.-Integr. Manuf."},{"key":"10.1016\/j.rcim.2026.103246_bib0027","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.rcim.2024.102841","article-title":"Out-of-order execution enabled deep reinforcement learning for dynamic additive manufacturing scheduling [J]","volume":"91","author":"Sun","year":"2025","journal-title":"Robot Comput.-Integr. Manuf."},{"issue":"2","key":"10.1016\/j.rcim.2026.103246_bib0028","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","article-title":"Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing [J]","volume":"87","author":"Melouk","year":"2004","journal-title":"Int. J. Prod. Econ."},{"issue":"12","key":"10.1016\/j.rcim.2026.103246_bib0029","doi-asserted-by":"crossref","first-page":"2337","DOI":"10.1080\/00207540500525254","article-title":"Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes [J]","volume":"44","author":"Kashan","year":"2006","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.rcim.2026.103246_bib0030","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jmsy.2010.06.007","article-title":"Scheduling a single batch-processing machine with non-identical job sizes in fuzzy environment using an improved ant colony optimization [J]","volume":"29","author":"Cheng","year":"2010","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.rcim.2026.103246_bib0031","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.cie.2018.06.018","article-title":"A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes [J]","volume":"123","author":"Zhou","year":"2018","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.rcim.2026.103246_bib0032","doi-asserted-by":"crossref","first-page":"281","DOI":"10.15388\/Informatica.2018.168","article-title":"Single-machine and parallel-machine parallel-batching scheduling considering deteriorating jobs, various group, and time-dependent setup time [J]","volume":"29","author":"Liao","year":"2018","journal-title":"Informatica"},{"key":"10.1016\/j.rcim.2026.103246_bib0033","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.asoc.2019.105657","article-title":"Enhanced grouping league championship and optics inspired optimization algorithms for scheduling a batch processing machine with job conflicts and non-identical job sizes [J]","volume":"83","author":"Alizadeh","year":"2019","journal-title":"Appl. Soft. Comput."},{"key":"10.1016\/j.rcim.2026.103246_bib0034","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1155\/2022\/5056356","article-title":"Self-adaptive multiobjective differential evolution algorithm for the unrelated parallel batch processing machine scheduling problem [J]","volume":"2022","author":"Song","year":"2022","journal-title":"Math. Probl. Eng."},{"issue":"3","key":"10.1016\/j.rcim.2026.103246_bib0035","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1051\/ro\/2023050","article-title":"Effective league championship algorithm and lower bound procedure for scheduling a single batch-processing machine with non-identical job sizes and job rejection [J]","volume":"57","author":"Afkhami","year":"2023","journal-title":"Rairo.-Oper. Res."},{"key":"10.1016\/j.rcim.2026.103246_bib0036","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.engappai.2023.107458","article-title":"A knowledge-guided bi-population evolutionary algorithm for energy-efficient scheduling of distributed flexible job shop problem [J]","volume":"128","author":"Yu","year":"2024","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.rcim.2026.103246_bib0037","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10845-013-0859-2","article-title":"An ACO-based intercell scheduling approach for job shop cells with multiple single processing machines and one batch processing machine [J]","volume":"27","author":"Li","year":"2016","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.rcim.2026.103246_bib0038","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.apm.2016.12.034","article-title":"Flexible job shop scheduling problem for parallel batch processing machine with compatible job families [J]","volume":"45","author":"Ham","year":"2017","journal-title":"Appl. Math Model"},{"key":"10.1016\/j.rcim.2026.103246_bib0039","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.engappai.2022.104735","article-title":"Auction-based approach with improved disjunctive graph model for job shop scheduling problem with parallel batch processing [J]","volume":"110","author":"Zeng","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.rcim.2026.103246_bib0040","series-title":"proceedings of the 14th International Conference on Metaheuristics (MIC), Univ Catania, Dept Architecture, Syracuse, ITALY, F Jul 11-14, 2022 [C]","article-title":"Scheduling jobs in flexible flow shops with s-batching machines using metaheuristics","author":"Rocholl","year":"2023"},{"issue":"2","key":"10.1016\/j.rcim.2026.103246_bib0041","first-page":"197","article-title":"A job-insertion heuristic for minimizing the mean flowtime in dynamic flowshops [J]","volume":"6","author":"Guang","year":"2011","journal-title":"Front. Mech. Eng."},{"key":"10.1016\/j.rcim.2026.103246_bib0042","series-title":"proceedings of the 27th International Conference on Computer Supported Cooperative Work in Design (CSCWD), Tianjin, PEOPLES R CHINA, F May 08-10, 2024 [C]","article-title":"A hybrid genetic algorithm for flexible job shop scheduling problem with batch processing machines","author":"Wang","year":"2024"},{"issue":"5","key":"10.1016\/j.rcim.2026.103246_bib0043","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence [J]","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.rcim.2026.103246_bib0044","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.engappai.2022.105443","article-title":"A heuristic and meta-heuristic based on problem-specific knowledge for distributed blocking flow-shop scheduling problem with sequence-dependent setup times [J]","volume":"116","author":"Zhao","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.rcim.2026.103246_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110324","article-title":"An improved co-evolutionary memetic algorithm based on novel schedule type and unconditional feasibility for hybrid flow-shop scheduling problem [J]","author":"Teng","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.rcim.2026.103246_bib0046","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.rcim.2025.102981","article-title":"A disjunctive graph-based metaheuristic for flexible job-shop scheduling problems considering fixture shortages in customized manufacturing systems [J]","volume":"95","author":"Li","year":"2025","journal-title":"Robot Comput.-Integr. Manuf."},{"key":"10.1016\/j.rcim.2026.103246_bib0047","series-title":"A Controlled Search Simulated Annealing Method for the General Job-Shop Scheduling Problem [J]","author":"Matsuo","year":"1988"},{"issue":"6","key":"10.1016\/j.rcim.2026.103246_bib0048","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem [J]","volume":"42","author":"Nowicki","year":"1996","journal-title":"Manage Sci."},{"issue":"4","key":"10.1016\/j.rcim.2026.103246_bib0049","first-page":"23","article-title":"A hybrid particle swarm optimisation for flexible casting job shop scheduling problem with batch processing machine [J]","volume":"6","author":"Zhang","year":"2024","journal-title":"IET Collab Intell. Manufact."},{"issue":"3","key":"10.1016\/j.rcim.2026.103246_bib0050","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search [J]","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Ann. Oper. Res."},{"issue":"19","key":"10.1016\/j.rcim.2026.103246_bib0051","doi-asserted-by":"crossref","first-page":"7238","DOI":"10.1080\/00207543.2025.2496971","article-title":"An efficient problem-specific evolutionary algorithm for flexible job shop scheduling problem with specific workers in highly customised manufacturing systems [J]","volume":"63","author":"Li","year":"2025","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.rcim.2026.103246_bib0052","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.swevo.2025.101873","article-title":"An improved adaptive hybrid algorithm for solving distributed flexible job shop scheduling problem [J]","volume":"94","author":"Wang","year":"2025","journal-title":"Swarm. Evol. Comput."},{"key":"10.1016\/j.rcim.2026.103246_bib0053","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.rcim.2023.102706","article-title":"A human-cyber-physical system enabled sequential disassembly planning approach for a human-robot collaboration cell in Industry 5.0 [J]","volume":"87","author":"Lou","year":"2024","journal-title":"Robot Comput.-Integr. Manuf."}],"container-title":["Robotics and Computer-Integrated Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0736584526000256?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0736584526000256?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T02:46:21Z","timestamp":1782960381000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0736584526000256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":53,"alternative-id":["S0736584526000256"],"URL":"https:\/\/doi.org\/10.1016\/j.rcim.2026.103246","relation":{},"ISSN":["0736-5845"],"issn-type":[{"value":"0736-5845","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adaptive active decoding and novel disjunctive graph-based improved genetic algorithm for multi-type machine robot cell scheduling in mass customization","name":"articletitle","label":"Article Title"},{"value":"Robotics and Computer-Integrated Manufacturing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.rcim.2026.103246","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103246"}}