{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T21:03:35Z","timestamp":1784235815420,"version":"3.55.0"},"reference-count":54,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004147","name":"Tsinghua University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62473069"],"award-info":[{"award-number":["62473069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2027,1]]},"DOI":"10.1016\/j.eswa.2026.133268","type":"journal-article","created":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T16:10:05Z","timestamp":1783959005000},"page":"133268","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PB","title":["Pareto optimization for learning-effect scheduling in a distributed flow shop with release dates"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2240-6032","authenticated-orcid":false,"given":"Xiaoyuan","family":"Bai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7884-7012","authenticated-orcid":false,"given":"Danyu","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1225-8319","authenticated-orcid":false,"given":"Feng","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6568-9709","authenticated-orcid":false,"given":"Jie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1485-0722","authenticated-orcid":false,"given":"Liang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5873-6948","authenticated-orcid":false,"given":"Melek","family":"Rodoplu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2026.133268_b0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106009","article-title":"A branch-and-cut approach for the distributed no-wait flowshop scheduling problem","volume":"148","author":"Avci","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133268_b0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107309","article-title":"Minimization of maximum lateness in a flowshop learning effect scheduling with release dates","volume":"158","author":"Bai","year":"2021","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.eswa.2026.133268_b0015","article-title":"Scheduling a distributed permutation flowshop with uniform machines and release dates","author":"Bai","year":"2024","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"10.1016\/j.eswa.2026.133268_b0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102101","article-title":"Discrete optimization algorithms for distributed bi-agent flowshop scheduling with release dates","volume":"98","author":"Bai","year":"2025","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.eswa.2026.133268_b0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2023.101399","article-title":"A collaborative iterated greedy algorithm with reinforcement learning for energy-aware distributed blocking flow-shop scheduling","volume":"83","author":"Bao","year":"2023","journal-title":"Swarm and Evolutionary Computation"},{"issue":"3","key":"10.1016\/j.eswa.2026.133268_b0030","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: Column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Operations research"},{"issue":"1","key":"10.1016\/j.eswa.2026.133268_b0035","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","article-title":"Single-machine scheduling with learning considerations","volume":"115","author":"Biskup","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133268_b0040","unstructured":"BryceTech. Global Space Launch Activity in 2024. Retrieved from https:\/\/brycetech.com\/reports\/report-documents\/global-space-launch-activity-2024\/. Accessed 14 September 2025."},{"issue":"3","key":"10.1016\/j.eswa.2026.133268_b0045","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.ejor.2024.03.011","article-title":"A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs","volume":"316","author":"Chen","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.eswa.2026.133268_b0050","doi-asserted-by":"crossref","first-page":"6361","DOI":"10.1007\/s00521-022-08012-8","article-title":"Energy-efficient distributed heterogeneous blocking flowshop scheduling problem using a knowledge-based iterated Pareto greedy algorithm","volume":"35","author":"Chen","year":"2023","journal-title":"Neural Computing and Applications"},{"key":"10.1016\/j.eswa.2026.133268_b0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2026.04.034","article-title":"Heuristic algorithms based on multi-stage or adaptive strategies for a distributed heterogeneous permutation flowshop scheduling problem with release time","author":"Cheng","year":"2026","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133268_b0060","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1019216726076","article-title":"Single machine scheduling with learning effect considerations","volume":"98","author":"Cheng","year":"2000","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"10.1016\/j.eswa.2026.133268_b0065","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","article-title":"A branch\u2010and\u2010bound algorithm to minimize total tardiness with different release dates","volume":"39","author":"Chu","year":"1992","journal-title":"Naval Research Logistics (NRL)"},{"key":"10.1016\/j.eswa.2026.133268_b0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.119805","article-title":"An improved multi-population genetic algorithm with a greedy job insertion inter-factory neighborhood structure for distributed heterogeneous hybrid flow shop scheduling problem","volume":"222","author":"Cui","year":"2023","journal-title":"Expert Systems with Applications"},{"issue":"12","key":"10.1016\/j.eswa.2026.133268_b0075","doi-asserted-by":"crossref","first-page":"4427","DOI":"10.1080\/00207543.2023.2262616","article-title":"Multi-population genetic algorithm with greedy job insertion inter-factory neighbourhoods for multi-objective distributed hybrid flow-shop scheduling with unrelated-parallel machines considering tardiness","volume":"62","author":"Cui","year":"2024","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.eswa.2026.133268_b0080","unstructured":"EaglePicher Technologies. (n.d.). FAQs. Retrieved from https:\/\/www.eaglepicher.com\/about-us\/faqs\/."},{"key":"10.1016\/j.eswa.2026.133268_b0085","unstructured":"EU Agency for the Space Programme (EUSPA). The EU Space Programme. Retrieved from https:\/\/www.euspa.europa.eu\/eu-space-programme. Accessed 14 September 2025."},{"key":"10.1016\/j.eswa.2026.133268_b0090","unstructured":"European Space Agency. Power Systems. Retrieved from https:\/\/www.esa.int\/Enabling_Support\/Space_Engineering_Technology\/Power_Systems. Accessed 23 April 2026."},{"key":"10.1016\/j.eswa.2026.133268_b0095","doi-asserted-by":"crossref","DOI":"10.1016\/j.jii.2021.100233","article-title":"Sustainable distributed permutation flow-shop scheduling model based on a triple bottom line concept","volume":"24","author":"Fathollahi-Fard","year":"2021","journal-title":"Journal of Industrial Information Integration"},{"issue":"3","key":"10.1016\/j.eswa.2026.133268_b0100","doi-asserted-by":"crossref","first-page":"2137","DOI":"10.1109\/TETCI.2025.3540422","article-title":"Multi-objective integrated energy-efficient scheduling of distributed flexible job shop and vehicle routing by knowledge-and-learning-based hyper-heuristics","volume":"9","author":"Fu","year":"2025","journal-title":"IEEE Transactions on Emerging Topics in Computational Intelligence"},{"key":"10.1016\/j.eswa.2026.133268_b0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105006","article-title":"An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem","volume":"123","author":"Hamzaday\u0131","year":"2020","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133268_b0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120837","article-title":"Q-learning driven multi-population memetic algorithm for distributed three-stage assembly hybrid flow shop scheduling with flexible preventive maintenance","volume":"232","author":"Jia","year":"2023","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.133268_b0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107832","article-title":"An evolution strategy approach for the distributed blocking flowshop scheduling problem","volume":"163","author":"Karabulut","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.eswa.2026.133268_b0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106946","article-title":"A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem","volume":"100","author":"Li","year":"2021","journal-title":"Applied soft computing"},{"key":"10.1016\/j.eswa.2026.133268_b0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.107011","article-title":"A problem-specific knowledge based artificial bee colony algorithm for scheduling distributed permutation flowshop problems with peak power consumption","volume":"126","author":"Li","year":"2023","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.eswa.2026.133268_b0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109717","article-title":"Modelling and optimization of distributed assembly hybrid flowshop scheduling problem with transportation resource scheduling","volume":"186","author":"Luo","year":"2023","journal-title":"Computers & Industrial Engineering"},{"issue":"11","key":"10.1016\/j.eswa.2026.133268_b0140","doi-asserted-by":"crossref","first-page":"4973","DOI":"10.1007\/s00170-023-11707-4","article-title":"Multi-objective production scheduling optimization and management control system of complex aerospace components: A review","volume":"127","author":"Ma","year":"2023","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"10.1016\/j.eswa.2026.133268_b0145","unstructured":"McDowell, J. (2026). Satellite Annual Statistics (planet4589.org\/space\/stats\/out\/satannual.txt). Retrieved February 23, 2026, from https:\/\/planet4589.org\/space\/stats\/out\/satannual.txt."},{"issue":"1","key":"10.1016\/j.eswa.2026.133268_b0150","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ejor.2022.02.019","article-title":"A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows","volume":"303","author":"Missaoui","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.eswa.2026.133268_b0155","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1287\/ijoc.2023.1287","article-title":"Mixed-integer programming vs. constraint programming for shop scheduling problems: New results and outlook","volume":"35","author":"Naderi","year":"2023","journal-title":"Informs Journal on Computing"},{"issue":"4","key":"10.1016\/j.eswa.2026.133268_b0160","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","article-title":"The distributed permutation flowshop scheduling problem","volume":"37","author":"Naderi","year":"2010","journal-title":"Computers & operations research"},{"issue":"3","key":"10.1016\/j.eswa.2026.133268_b0165","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1080\/05695556908974435","article-title":"On startup or learning curves: An expanded view","volume":"1","author":"Pegels","year":"1969","journal-title":"AIIE Transactions"},{"issue":"6","key":"10.1016\/j.eswa.2026.133268_b0170","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1080\/00207543.2022.2049911","article-title":"A concise guide to scheduling with learning and deteriorating effects","volume":"61","author":"Pei","year":"2023","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.eswa.2026.133268_b0175","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2023.02.001","article-title":"A review and classification on distributed permutation flowshop scheduling problems","volume":"312","author":"Perez-Gonzalez","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133268_b0180","doi-asserted-by":"crossref","unstructured":"Pinedo, M. L. (2012). Scheduling (Vol. 29, p. 249). New York: Springer. https:\/\/doi.org\/10.1007\/978-3-031-05921-6.","DOI":"10.1007\/978-3-031-05921-6"},{"key":"10.1016\/j.eswa.2026.133268_b0185","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2026.132430","article-title":"Evaluation and simulation of congestion effects of digital production factors in industrial virtual agglomeration: Based on DEA and swarm intelligence-driven neural networks","volume":"323","author":"Ren","year":"2026","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.133268_b0190","doi-asserted-by":"crossref","unstructured":"Sengupta, S. (2003). Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. In Workshop on Algorithms and Data Structures (pp. 79-90). Berlin, Heidelberg: Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-45078-8_8.","DOI":"10.1007\/978-3-540-45078-8_8"},{"issue":"3","key":"10.1016\/j.eswa.2026.133268_b0195","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1002\/nav.22097","article-title":"Maximizing the weighted number of just\u2010in\u2010time jobs in a distributed flow\u2010shop scheduling system","volume":"70","author":"Shabtay","year":"2023","journal-title":"Naval Research Logistics (NRL)"},{"key":"10.1016\/j.eswa.2026.133268_b0205","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1287\/opre.17.2.368","article-title":"A method for obtaining the optimal dual solution to a linear program using the Dantzig-Wolfe decomposition","author":"Walker","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/j.eswa.2026.133268_b0210","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101772","article-title":"A learning-based memetic algorithm for energy-efficient distributed flow-shop scheduling with preventive maintenance","volume":"92","author":"Wang","year":"2025","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.eswa.2026.133268_b0215","article-title":"Sustainable scheduling of distributed flow shop group: A collaborative multi-objective evolutionary algorithm driven by indicators","author":"Wang","year":"2023","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"10.1016\/j.eswa.2026.133268_b0220","doi-asserted-by":"crossref","first-page":"2399","DOI":"10.1109\/TSMC.2024.3518625","article-title":"Reinforcement learning-assisted memetic algorithm for sustainability-oriented multiobjective distributed flow shop group scheduling","volume":"55","author":"Wang","year":"2025","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"3","key":"10.1016\/j.eswa.2026.133268_b0225","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1109\/TSMC.2024.3520320","article-title":"A bi-population cooperative discrete differential evolution for multiobjective energy-efficient distributed blocking flow shop scheduling problem","volume":"55","author":"Wang","year":"2025","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"4","key":"10.1016\/j.eswa.2026.133268_b0230","doi-asserted-by":"crossref","first-page":"122","DOI":"10.2514\/8.155","article-title":"Factors affecting the cost of airplanes","volume":"3","author":"Wright","year":"1936","journal-title":"Journal of the aeronautical sciences"},{"issue":"24","key":"10.1016\/j.eswa.2026.133268_b0235","doi-asserted-by":"crossref","first-page":"10517","DOI":"10.1080\/00207543.2025.2553820","article-title":"Enhanced logic-based Benders decomposition methods for the distributed heterogeneous non-permutation flow shop scheduling problem","volume":"63","author":"Xiong","year":"2025","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.eswa.2026.133268_b0240","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107044","article-title":"Logic-based Benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost","volume":"179","author":"Xiong","year":"2025","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133268_b0245","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2026.102403","article-title":"Adaptive fruit fly optimization-assisted logic-based benders decomposition for distributed parallel precast flowshop scheduling","volume":"105","author":"Xiong","year":"2026","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.eswa.2026.133268_b0250","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110563","article-title":"An artificial immune differential evolution algorithm for scheduling a distributed heterogeneous flexible flowshop","volume":"145","author":"Xuan","year":"2023","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.eswa.2026.133268_b0255","article-title":"Q-learning-based multi-objective particle swarm optimization with local search within factories for energy-efficient distributed flow-shop scheduling problem","volume":"1\u201324","author":"Zhang","year":"2023","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/j.eswa.2026.133268_b0260","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121570","article-title":"A multiobjective memetic algorithm with particle swarm optimization and Q-learning-based local search for energy-efficient distributed heterogeneous hybrid flow-shop scheduling problem","volume":"237","author":"Zhang","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.133268_b0265","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.126526","article-title":"MEDHEA: Multidimensional estimation of distribution based hyper-heuristic evolutionary algorithm for energy-efficient distributed assembly no-wait flow-shop scheduling problem","volume":"271","author":"Zhang","year":"2025","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"10.1016\/j.eswa.2026.133268_b0270","doi-asserted-by":"crossref","first-page":"3337","DOI":"10.1109\/TCYB.2022.3192112","article-title":"A hyperheuristic with Q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem","volume":"53","author":"Zhao","year":"2022","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"7","key":"10.1016\/j.eswa.2026.133268_b0275","doi-asserted-by":"crossref","first-page":"8427","DOI":"10.1109\/TII.2022.3218645","article-title":"A reinforcement learning driven cooperative meta-heuristic algorithm for energy-efficient distributed no-wait flow-shop scheduling with sequence-dependent setup time","volume":"19","author":"Zhao","year":"2022","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"10.1016\/j.eswa.2026.133268_b0280","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109082","article-title":"A cooperative whale optimization algorithm for energy-efficient scheduling of the distributed blocking flow-shop with sequence-dependent setup time","volume":"178","author":"Zhao","year":"2023","journal-title":"Computers & Industrial Engineering"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426021779?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426021779?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T20:09:07Z","timestamp":1784232547000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417426021779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2027,1]]},"references-count":54,"alternative-id":["S0957417426021779"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2026.133268","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2027,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pareto optimization for learning-effect scheduling in a distributed flow shop with release dates","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2026.133268","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":"133268"}}