{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T16:19:27Z","timestamp":1773505167723,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 110-2221-E-027-107"],"award-info":[{"award-number":["MOST 110-2221-E-027-107"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10479-022-04537-2","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T08:03:24Z","timestamp":1643875404000},"page":"125-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups"],"prefix":"10.1007","volume":"322","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1207-3587","authenticated-orcid":false,"given":"Pourya","family":"Pourhejazy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen-Yang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9549-5290","authenticated-orcid":false,"given":"Kuo-Ching","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Hoai","family":"Nam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"key":"4537_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-020-00484-3","author":"A Ali","year":"2020","unstructured":"Ali, A., Gajpal, Y., & Elmekkawy, T. Y. (2020). Distributed permutation flowshop scheduling problem with total completion time objective. Opsearch. https:\/\/doi.org\/10.1007\/s12597-020-00484-3","journal-title":"Opsearch"},{"key":"4537_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107229","author":"C-Y Cheng","year":"2021","unstructured":"Cheng, C.-Y., Pourhejazy, P., Ying, K.-C., & Huang, S.-Y. (2021). New benchmark algorithm for minimizing total completion time in blocking flowshops with sequence-dependent setup times. Applied Soft Computing. https:\/\/doi.org\/10.1016\/j.asoc.2021.107229","journal-title":"Applied Soft Computing"},{"issue":"12","key":"4537_CR3","doi-asserted-by":"publisher","first-page":"3561","DOI":"10.1080\/00207543.2015.1084063","volume":"54","author":"J Deng","year":"2016","unstructured":"Deng, J., Wang, L., Wang, S., & Zheng, X. (2016). A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem. International Journal of Production Research, 54(12), 3561\u20133577. https:\/\/doi.org\/10.1080\/00207543.2015.1084063","journal-title":"International Journal of Production Research"},{"issue":"1","key":"4537_CR4","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10462-018-9667-6","volume":"53","author":"MH Fazel Zarandi","year":"2020","unstructured":"Fazel Zarandi, M. H., Sadat Asl, A. A., Sotudian, S., & Castillo, O. (2020). A state of the art review of intelligent scheduling. Artificial Intelligence Review, 53(1), 501\u2013593. https:\/\/doi.org\/10.1007\/s10462-018-9667-6","journal-title":"Artificial Intelligence Review"},{"key":"4537_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.simpat.2017.09.001","volume":"79","author":"EM Gonzalez-Neira","year":"2017","unstructured":"Gonzalez-Neira, E. M., Ferone, D., Hatami, S., & Juan, A. A. (2017). A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times. Simulation Modelling Practice and Theory, 79, 23\u201336. https:\/\/doi.org\/10.1016\/j.simpat.2017.09.001","journal-title":"Simulation Modelling Practice and Theory"},{"key":"4537_CR6","doi-asserted-by":"publisher","first-page":"66879","DOI":"10.1109\/ACCESS.2019.2917273","volume":"7","author":"J-H Hao","year":"2019","unstructured":"Hao, J.-H., Li, J.-Q., Du, Y., Song, M.-X., Duan, P., & Zhang, Y.-Y. (2019). Solving distributed hybrid flowshop scheduling problems by a hybrid brain storm optimization algorithm. Ieee Access, 7, 66879\u201366894. https:\/\/doi.org\/10.1109\/ACCESS.2019.2917273","journal-title":"Ieee Access"},{"issue":"17","key":"4537_CR7","doi-asserted-by":"publisher","first-page":"5292","DOI":"10.1080\/00207543.2013.807955","volume":"51","author":"S Hatami","year":"2013","unstructured":"Hatami, S., Ruiz, R., & Andr\u00e9s-Romano, C. (2013). The distributed assembly permutation flowshop scheduling problem. International Journal of Production Research, 51(17), 5292\u20135308. https:\/\/doi.org\/10.1080\/00207543.2013.807955","journal-title":"International Journal of Production Research"},{"key":"4537_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ijpe.2015.07.027","volume":"169","author":"S Hatami","year":"2015","unstructured":"Hatami, S., Ruiz, R., & Andr\u00e9s-Romano, C. (2015). Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times. International Journal of Production Economics, 169, 76\u201388. https:\/\/doi.org\/10.1016\/j.ijpe.2015.07.027","journal-title":"International Journal of Production Economics"},{"key":"4537_CR9","doi-asserted-by":"publisher","first-page":"107021","DOI":"10.1016\/j.cie.2020.107021","volume":"152","author":"Y-Y Huang","year":"2021","unstructured":"Huang, Y.-Y., Pan, Q.-K., Huang, J.-P., Suganthan, P. N., & Gao, L. (2021). An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem. Computers & Industrial Engineering, 152, 107021.","journal-title":"Computers & Industrial Engineering"},{"key":"4537_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100742","volume":"59","author":"J-P Huang","year":"2020","unstructured":"Huang, J.-P., Pan, Q.-K., & Gao, L. (2020). An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Swarm and Evolutionary Computation, 59, 100742. https:\/\/doi.org\/10.1016\/j.swevo.2020.100742","journal-title":"Swarm and Evolutionary Computation"},{"key":"4537_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104016","volume":"97","author":"J-P Huang","year":"2021","unstructured":"Huang, J.-P., Pan, Q.-K., Miao, Z.-H., & Gao, L. (2021a). Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times. Engineering Applications of Artificial Intelligence, 97, 104016. https:\/\/doi.org\/10.1016\/j.engappai.2020.104016","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"2","key":"4537_CR12","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S0278-6125(02)80006-1","volume":"21","author":"I-J Jeong","year":"2002","unstructured":"Jeong, I.-J., & Leon, V. J. (2002). A distributed scheduling methodology for a two-machine flowshop using cooperative interaction via multiple coupling agents. Journal of Manufacturing Systems, 21(2), 126\u2013139.","journal-title":"Journal of Manufacturing Systems"},{"issue":"1","key":"4537_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1177\/1063293X02010001054","volume":"10","author":"HZ Jia","year":"2002","unstructured":"Jia, H. Z., Fuh, J. Y. H., Nee, A. Y. C., & Zhang, Y. F. (2002). Web-based multi-functional scheduling system for a distributed manufacturing environment. Concurrent Engineering, 10(1), 27\u201339. https:\/\/doi.org\/10.1177\/1063293X02010001054","journal-title":"Concurrent Engineering"},{"issue":"3\u20134","key":"4537_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1024653810491","volume":"14","author":"HZ Jia","year":"2003","unstructured":"Jia, H. Z., Nee, A. Y. C., Fuh, J. Y. H., & Zhang, Y. F. (2003). A modified genetic algorithm for distributed scheduling problems. Journal of Intelligent Manufacturing, 14(3\u20134), 351\u2013362. https:\/\/doi.org\/10.1023\/A:1024653810491","journal-title":"Journal of Intelligent Manufacturing"},{"key":"4537_CR15","doi-asserted-by":"publisher","first-page":"106629","DOI":"10.1016\/j.asoc.2020.106629","volume":"96","author":"X-L Jing","year":"2020","unstructured":"Jing, X.-L., Pan, Q.-K., Gao, L., & Wang, Y.-L. (2020). An effective Iterated Greedy algorithm for the distributed permutation flowshop scheduling with due windows. Applied Soft Computing, 96, 106629.","journal-title":"Applied Soft Computing"},{"key":"4537_CR16","first-page":"1","volume":"59","author":"A Khare","year":"2020","unstructured":"Khare, A., & Agrawal, S. (2020). Effective heuristics and metaheuristics to minimise total tardiness for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 59, 1\u201317.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"4537_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s11740-017-0716-9","volume":"11","author":"M Komaki","year":"2017","unstructured":"Komaki, M., & Malakooti, B. (2017). General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem. Production Engineering, 11(3), 315\u2013329.","journal-title":"Production Engineering"},{"issue":"5","key":"4537_CR18","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","volume":"39","author":"C-Y Lee","year":"1993","unstructured":"Lee, C.-Y., Cheng, T. C. E., & Lin, B. M. T. (1993). Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science, 39(5), 616\u2013625. https:\/\/doi.org\/10.1287\/mnsc.39.5.616","journal-title":"Management Science"},{"key":"4537_CR19","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1836422","author":"D Lei","year":"2020","unstructured":"Lei, D., Su, B., & Li, M. (2020). Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling. International Journal of Production Research. https:\/\/doi.org\/10.1080\/00207543.2020.1836422","journal-title":"International Journal of Production Research"},{"issue":"9","key":"4537_CR20","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1080\/0305215X.2019.1674295","volume":"52","author":"D Lei","year":"2020","unstructured":"Lei, D., & Wang, T. (2020). Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping. Engineering Optimization, 52(9), 1461\u20131474. https:\/\/doi.org\/10.1080\/0305215X.2019.1674295","journal-title":"Engineering Optimization"},{"key":"4537_CR21","doi-asserted-by":"publisher","first-page":"106946","DOI":"10.1016\/j.asoc.2020.106946","volume":"100","author":"H Li","year":"2020","unstructured":"Li, H., Li, X., & Gao, L. (2020). A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem. Applied Soft Computing, 100, 106946.","journal-title":"Applied Soft Computing"},{"issue":"5","key":"4537_CR22","doi-asserted-by":"publisher","first-page":"172988141987981","DOI":"10.1177\/1729881419879819","volume":"16","author":"W Li","year":"2019","unstructured":"Li, W., Li, J., Gao, K., Han, Y., Niu, B., Liu, Z., & Sun, Q. (2019). Solving robotic distributed flowshop problem using an improved iterated greedy algorithm. International Journal of Advanced Robotic Systems, 16(5), 1729881419879819.","journal-title":"International Journal of Advanced Robotic Systems"},{"key":"4537_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106638","volume":"147","author":"Y Li","year":"2020","unstructured":"Li, Y., Li, X., Gao, L., & Meng, L. (2020b). An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times. Computers & Industrial Engineering, 147, 106638. https:\/\/doi.org\/10.1016\/j.cie.2020.106638","journal-title":"Computers & Industrial Engineering"},{"key":"4537_CR24","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1753897","author":"Y Li","year":"2020","unstructured":"Li, Y., Li, X., Gao, L., Zhang, B., Pan, Q.-K., Tasgetiren, M. F., & Meng, L. (2020c). A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. International Journal of Production Research. https:\/\/doi.org\/10.1080\/00207543.2020.1753897","journal-title":"International Journal of Production Research"},{"key":"4537_CR25","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.cie.2016.07.027","volume":"99","author":"S-W Lin","year":"2016","unstructured":"Lin, S.-W., & Ying, K.-C. (2016). Minimizing makespan for solving the distributed no-wait flowshop scheduling problem. Computers & Industrial Engineering, 99, 202\u2013209.","journal-title":"Computers & Industrial Engineering"},{"key":"4537_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/8170294","volume":"2018","author":"W-C Lin","year":"2018","unstructured":"Lin, W.-C. (2018). Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect. Discrete Dynamics in Nature and Society, 2018, 1\u201315. https:\/\/doi.org\/10.1155\/2018\/8170294","journal-title":"Discrete Dynamics in Nature and Society"},{"key":"4537_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114495","volume":"169","author":"J Mao","year":"2021","unstructured":"Mao, J., Pan, Q., Miao, Z., & Gao, L. (2021). An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance. Expert Systems with Applications, 169, 114495. https:\/\/doi.org\/10.1016\/j.eswa.2020.114495","journal-title":"Expert Systems with Applications"},{"key":"4537_CR28","doi-asserted-by":"publisher","first-page":"104894","DOI":"10.1016\/j.knosys.2019.104894","volume":"184","author":"T Meng","year":"2019","unstructured":"Meng, T., Pan, Q.-K., & Wang, L. (2019). A distributed permutation flowshop scheduling problem with the customer order constraint. Knowledge-Based Systems, 184, 104894.","journal-title":"Knowledge-Based Systems"},{"key":"4537_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100804","volume":"60","author":"T Meng","year":"2021","unstructured":"Meng, T., & Pan, Q.-K. (2021). A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time. Swarm and Evolutionary Computation, 60, 100804. https:\/\/doi.org\/10.1016\/j.swevo.2020.100804","journal-title":"Swarm and Evolutionary Computation"},{"issue":"4","key":"4537_CR30","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi, B., & Ruiz, R. (2010). The distributed permutation flowshop scheduling problem. Computers & Operations Research, 37(4), 754\u2013768. https:\/\/doi.org\/10.1016\/j.cor.2009.06.019","journal-title":"Computers & Operations Research"},{"key":"4537_CR31","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"JS Neufeld","year":"2016","unstructured":"Neufeld, J. S., Gupta, J. N. D., & Buscher, U. (2016). A comprehensive review of flowshop group scheduling literature. Computers & Operations Research, 70, 56\u201374. https:\/\/doi.org\/10.1016\/j.cor.2015.12.006","journal-title":"Computers & Operations Research"},{"issue":"2","key":"4537_CR32","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong, Y. S., & Keane, A. J. (2004). Meta-Lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation, 8(2), 99\u2013110.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"4537_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105044","volume":"125","author":"FB Ozsoydan","year":"2021","unstructured":"Ozsoydan, F. B., & Sagir, M. (2021). Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: A case study at a manufacturing plant. Computers & Operations Research, 125, 105044. https:\/\/doi.org\/10.1016\/j.cor.2020.105044","journal-title":"Computers & Operations Research"},{"key":"4537_CR34","doi-asserted-by":"publisher","unstructured":"Pan, J.-Q., Zou, W.-Q., & Duan, J.-H. (2018). A discrete artificial bee colony for distributed permutation flowshop scheduling problem with total flow time minimization. In 2018 37th Chinese Control Conference (CCC) (pp. 8379\u20138383). IEEE. https:\/\/doi.org\/10.23919\/ChiCC.2018.8482716.","DOI":"10.23919\/ChiCC.2018.8482716"},{"key":"4537_CR35","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3041494","author":"Q-K Pan","year":"2021","unstructured":"Pan, Q.-K., Gao, L., & Wang, L. (2021). An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems. IEEE Transactions on Cybernetics. https:\/\/doi.org\/10.1109\/TCYB.2020.3041494","journal-title":"IEEE Transactions on Cybernetics"},{"key":"4537_CR36","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","volume":"124","author":"Q-K Pan","year":"2019","unstructured":"Pan, Q.-K., Gao, L., Wang, L., Liang, J., & Li, X.-Y. (2019). Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Systems with Applications, 124, 309\u2013324.","journal-title":"Expert Systems with Applications"},{"issue":"17","key":"4537_CR37","doi-asserted-by":"publisher","first-page":"5401","DOI":"10.1080\/00207543.2020.1718794","volume":"58","author":"M Parente","year":"2020","unstructured":"Parente, M., Figueira, G., Amorim, P., & Marques, A. (2020). Production scheduling in the context of Industry 4.0: Review and trends. International Journal of Production Research, 58(17), 5401\u20135431. https:\/\/doi.org\/10.1080\/00207543.2020.1718794","journal-title":"International Journal of Production Research"},{"issue":"2","key":"4537_CR38","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.43.2.346","volume":"43","author":"CN Potts","year":"1995","unstructured":"Potts, C. N., Sevast\u2019janov, S. V., Strusevich, V. A., Van Wassenhove, L. N., & Zwaneveld, C. M. (1995). The two-stage assembly scheduling problem: complexity and approximation. Operations Research, 43(2), 346\u2013355. https:\/\/doi.org\/10.1287\/opre.43.2.346","journal-title":"Operations Research"},{"key":"4537_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104839","author":"V Riahi","year":"2020","unstructured":"Riahi, V., Chiong, R., & Zhang, Y. (2020). A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion. Computers and Operations Research. https:\/\/doi.org\/10.1016\/j.cor.2019.104839","journal-title":"Computers and Operations Research"},{"issue":"8","key":"4537_CR40","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas, I., Leisten, R., & Frami\u00f1an, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research, 37(8), 1439\u20131454. https:\/\/doi.org\/10.1016\/j.cor.2009.11.001","journal-title":"Computers & Operations Research"},{"key":"4537_CR41","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz, R., Pan, Q.-K., & Naderi, B. (2019). Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega, 83, 213\u2013222. https:\/\/doi.org\/10.1016\/j.omega.2018.03.004","journal-title":"Omega"},{"key":"4537_CR42","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.swevo.2018.12.001","volume":"44","author":"H-Y Sang","year":"2019","unstructured":"Sang, H.-Y., Pan, Q.-K., Li, J.-Q., Wang, P., Han, Y.-Y., Gao, K.-Z., & Duan, P. (2019). Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion. Swarm and Evolutionary Computation, 44, 64\u201373.","journal-title":"Swarm and Evolutionary Computation"},{"key":"4537_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105527","volume":"194","author":"W Shao","year":"2020","unstructured":"Shao, W., Shao, Z., & Pi, D. (2020). Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem. Knowledge-Based Systems, 194, 105527. https:\/\/doi.org\/10.1016\/j.knosys.2020.105527","journal-title":"Knowledge-Based Systems"},{"key":"4537_CR44","volume-title":"Designing and managing the supply chain: Concepts strategies and case studies","author":"D Simchi-Levi","year":"2008","unstructured":"Simchi-Levi, D., Kaminsky, P., Simchi-Levi, E., & Shankar, R. (2008). Designing and managing the supply chain: Concepts strategies and case studies. Tata McGraw-Hill."},{"issue":"1","key":"4537_CR45","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1057\/jors.2015.50","volume":"67","author":"K Wang","year":"2016","unstructured":"Wang, K., Huang, Y., & Qin, H. (2016). A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown. Journal of the Operational Research Society, 67(1), 68\u201382. https:\/\/doi.org\/10.1057\/jors.2015.50","journal-title":"Journal of the Operational Research Society"},{"key":"4537_CR46","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.cie.2019.02.047","volume":"130","author":"C-C Wu","year":"2019","unstructured":"Wu, C.-C., Chen, J.-Y., Lin, W.-C., Lai, K., Bai, D., & Lai, S.-Y. (2019). A two-stage three-machine assembly scheduling flowshop problem with both two-agent and learning phenomenon. Computers & Industrial Engineering, 130, 485\u2013499. https:\/\/doi.org\/10.1016\/j.cie.2019.02.047","journal-title":"Computers & Industrial Engineering"},{"key":"4537_CR47","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.swevo.2018.01.012","volume":"41","author":"C-C Wu","year":"2018","unstructured":"Wu, C.-C., Chen, J.-Y., Lin, W.-C., Lai, K., Liu, S.-C., & Yu, P.-W. (2018). A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization. Swarm and Evolutionary Computation, 41, 97\u2013110. https:\/\/doi.org\/10.1016\/j.swevo.2018.01.012","journal-title":"Swarm and Evolutionary Computation"},{"issue":"9","key":"4537_CR48","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1080\/00207543.2014.884290","volume":"52","author":"F Xiong","year":"2014","unstructured":"Xiong, F., & Xing, K. (2014). Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time. International Journal of Production Research, 52(9), 2743\u20132766. https:\/\/doi.org\/10.1080\/00207543.2014.884290","journal-title":"International Journal of Production Research"},{"key":"4537_CR49","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cor.2014.02.005","volume":"47","author":"F Xiong","year":"2014","unstructured":"Xiong, F., Xing, K., Wang, F., Lei, H., & Han, L. (2014). Minimizing the total completion time in a distributed two stage assembly system with setup times. Computers & Operations Research, 47, 92\u2013105. https:\/\/doi.org\/10.1016\/j.cor.2014.02.005","journal-title":"Computers & Operations Research"},{"key":"4537_CR50","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1757174","author":"S Yang","year":"2020","unstructured":"Yang, S., & Xu, Z. (2020). The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery. International Journal of Production Research. https:\/\/doi.org\/10.1080\/00207543.2020.1757174","journal-title":"International Journal of Production Research"},{"key":"4537_CR51","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","volume":"92","author":"K-C Ying","year":"2018","unstructured":"Ying, K.-C., & Lin, S.-W. (2018). Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Systems with Applications, 92, 132\u2013141. https:\/\/doi.org\/10.1016\/j.eswa.2017.09.032","journal-title":"Expert Systems with Applications"},{"key":"4537_CR52","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.cie.2017.06.025","volume":"110","author":"K-C Ying","year":"2017","unstructured":"Ying, K.-C., Lin, S.-W., Cheng, C.-Y., & He, C.-D. (2017). Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Computers & Industrial Engineering, 110, 413\u2013423.","journal-title":"Computers & Industrial Engineering"},{"issue":"20","key":"4537_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2020.1842938","volume":"58","author":"K-C Ying","year":"2020","unstructured":"Ying, K.-C., Pourhejazy, P., Cheng, C.-Y., & Syu, R.-S. (2020). Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times. International Journal of Production Research, 58(20), 1\u201324. https:\/\/doi.org\/10.1080\/00207543.2020.1842938","journal-title":"International Journal of Production Research"},{"key":"4537_CR54","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.cie.2018.09.007","volume":"125","author":"G Zhang","year":"2018","unstructured":"Zhang, G., & Xing, K. (2018). Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment. Computers & Industrial Engineering, 125, 423\u2013433. https:\/\/doi.org\/10.1016\/j.cie.2018.09.007","journal-title":"Computers & Industrial Engineering"},{"key":"4537_CR55","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cor.2019.04.002","volume":"108","author":"G Zhang","year":"2019","unstructured":"Zhang, G., & Xing, K. (2019). Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion. Computers & Operations Research, 108, 33\u201343.","journal-title":"Computers & Operations Research"},{"key":"4537_CR56","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.engappai.2018.09.005","volume":"76","author":"G Zhang","year":"2018","unstructured":"Zhang, G., Xing, K., & Cao, F. (2018). Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion. Engineering Applications of Artificial Intelligence, 76, 96\u2013107.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"4537_CR57","doi-asserted-by":"publisher","first-page":"96115","DOI":"10.1109\/ACCESS.2020.2996305","volume":"8","author":"G Zhang","year":"2020","unstructured":"Zhang, G., Xing, K., Zhang, G., & He, Z. (2020a). Memetic algorithm with Meta-Lamarckian learning and simplex search for distributed flexible assembly permutation flowshop scheduling problem. IEEE Access, 8, 96115\u201396128. https:\/\/doi.org\/10.1109\/ACCESS.2020.2996305","journal-title":"IEEE Access"},{"issue":"2","key":"4537_CR58","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1504\/IJBIC.2020.106443","volume":"15","author":"X Zhang","year":"2020","unstructured":"Zhang, X., Li, X. T., & Yin, M. H. (2020b). An enhanced genetic algorithm for the distributed assembly permutation flowshop scheduling problem. International Journal of Bio-Inspired Computation, 15(2), 113. https:\/\/doi.org\/10.1504\/IJBIC.2020.106443","journal-title":"International Journal of Bio-Inspired Computation"},{"key":"4537_CR59","doi-asserted-by":"publisher","first-page":"113678","DOI":"10.1016\/j.eswa.2020.113678","volume":"160","author":"F Zhao","year":"2020","unstructured":"Zhao, F., Zhao, L., Wang, L., & Song, H. (2020). An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion. Expert Systems with Applications, 160, 113678.","journal-title":"Expert Systems with Applications"},{"key":"4537_CR60","doi-asserted-by":"publisher","first-page":"107082","DOI":"10.1016\/j.cie.2020.107082","volume":"153","author":"F Zhao","year":"2021","unstructured":"Zhao, F., Zhang, L., Cao, J., & Tang, J. (2021). A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Computers & Industrial Engineering, 153, 107082.","journal-title":"Computers & Industrial Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04537-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04537-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04537-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T16:27:16Z","timestamp":1676305636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04537-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["4537"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04537-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"18 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}