{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T09:08:34Z","timestamp":1774516114095,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:00:00Z","timestamp":1617926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper studies a real-world manufacturing problem, which is modeled as a bi-objective integer programming problem. The variables and constraints involved are usually numerous and dramatically vary according to the manufacturing data. It is very challenging to directly solve such large-scale problems using heuristic algorithms or commercial solvers. Considering that the decision space of such problems is usually sparse and has a block-like structure, we propose to use decomposition methods to accelerate the optimization process. However, the existing decomposition methods require that the problem has strict block structures, which is not suitable for our problem. To deal with problems with such block-like structures, we propose a game theory based decomposition algorithm. This new method can overcome the large-scale issue and guarantee convergence to some extent, as it can narrow down the search space and accelerate the convergence. Extensive experimental results on real-world industrial manufacturing planning problems show that our method is more effective than the world fastest commercial solver Gurobi. The results also indicate that our method is less sensitive to the problem scale comparing with Gurobi.<\/jats:p>","DOI":"10.1007\/s40747-021-00352-7","type":"journal-article","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T06:03:39Z","timestamp":1617948219000},"page":"2719-2730","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Accelerate the optimization of large-scale manufacturing planning using game theory"],"prefix":"10.1007","volume":"8","author":[{"given":"Hui-Ling","family":"Zhen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1152-6780","authenticated-orcid":false,"given":"Zhenkun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xijun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Mingxuan","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Jia","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"key":"352_CR1","doi-asserted-by":"crossref","unstructured":"Aazami A, Saidi-Mehrabad M (2018) Benders decomposition algorithm for robust aggregate production planning considering pricing decisions in competitive environment: a case study. Sci Iran","DOI":"10.24200\/sci.2018.5563.1346"},{"key":"352_CR2","first-page":"107","volume":"20","author":"RE Bixby","year":"2012","unstructured":"Bixby RE (2012) A brief history of linear and mixed-integer programming computation. Doc Math 20:107\u2013121","journal-title":"Doc Math"},{"key":"352_CR3","doi-asserted-by":"crossref","unstructured":"Bloem M, Alpcan T, Ba\u015far T (2007) A stackelberg game for power control and channel allocation in cognitive radio networks. In: Proceedings of the 2nd international conference on Performance evaluation methodologies and tools. ICST (Institute for Computer Sciences, Social-Informatics), p 4","DOI":"10.4108\/gamecomm.2007.2040"},{"key":"352_CR4","unstructured":"Casorr\u00e1n-Amilburu C (2017) Formulations and algorithms for general and security stackelberg games. Ph.D. thesis"},{"key":"352_CR5","volume-title":"Decomposition techniques in mathematical programming: engineering and science applications","author":"AJ Conejo","year":"2006","unstructured":"Conejo AJ, Castillo E, Minguez R, Garcia-Bertrand R (2006) Decomposition techniques in mathematical programming: engineering and science applications. Springer, Berlin"},{"issue":"7","key":"352_CR6","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1287\/mnsc.2016.2461","volume":"63","author":"M Fischetti","year":"2016","unstructured":"Fischetti M, Ljubi\u0107 I, Sinnl M (2016) Redesigning benders decomposition for large-scale facility location. Manag Sci 63(7):2146\u20132162","journal-title":"Manag Sci"},{"key":"352_CR7","unstructured":"Grover A, Markov T, Attia P, Jin N, Perkins N, Cheong B, Chen M, Yang Z, Harris S, Chueh W, et\u00a0al (2018) Best arm identification in multi-armed bandits with delayed feedback. arXiv:1803.10937 (arXiv preprint)"},{"key":"352_CR8","volume-title":"Lotsizing and scheduling for production planning","author":"K Haase","year":"2012","unstructured":"Haase K (2012) Lotsizing and scheduling for production planning, vol 408. Springer, Berlin"},{"issue":"1","key":"352_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/ijoc.1080.0283","volume":"21","author":"R Jans","year":"2009","unstructured":"Jans R (2009) Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS J Comput 21(1):123\u2013136","journal-title":"INFORMS J Comput"},{"key":"352_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.compchemeng.2015.11.004","volume":"85","author":"RM Lima","year":"2016","unstructured":"Lima RM, Novais AQ (2016) Symmetry breaking in MILP formulations for unit commitment problems. Comput Chem Eng 85:162\u2013176","journal-title":"Comput Chem Eng"},{"key":"352_CR11","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvjsf522","volume-title":"Game theory","author":"RB Myerson","year":"2013","unstructured":"Myerson RB (2013) Game theory. Harvard University Press, Harvard"},{"key":"352_CR12","volume-title":"Production planning by mixed integer programming","author":"Y Pochet","year":"2006","unstructured":"Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer, Berlin"},{"issue":"3","key":"352_CR13","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The benders decomposition algorithm: a literature review. Eur J Oper Res 259(3):801\u2013817","journal-title":"Eur J Oper Res"},{"issue":"1","key":"352_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck F (2000) On dantzig-wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper Res 48(1):111\u2013128","journal-title":"Oper Res"},{"key":"352_CR15","unstructured":"Velasquez J, Khakifirooz M, Fathi M (2019) Large scale optimization in supply chains and smart manufacturing-theory and applications"},{"key":"352_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.tre.2017.04.002","volume":"114","author":"W Yu","year":"2018","unstructured":"Yu W, Chavez R, Jacobs MA, Feng M (2018) Data-driven supply chain capabilities and performance: a resource-based view. Transport Res Part E Logist Transport Rev 114:371\u2013385","journal-title":"Transport Res Part E Logist Transport Rev"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00352-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00352-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00352-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T10:19:43Z","timestamp":1659521983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00352-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,9]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["352"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00352-7","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,9]]},"assertion":[{"value":"30 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}