{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T16:21:30Z","timestamp":1773332490736,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T00:00:00Z","timestamp":1677369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T00:00:00Z","timestamp":1677369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004569","name":"Ministerstwo Nauki i Szkolnictwa Wy\u017cszego","doi-asserted-by":"publisher","award":["02\/040\/BKM20\/0006"],"award-info":[{"award-number":["02\/040\/BKM20\/0006"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004569","name":"Ministerstwo Nauki i Szkolnictwa Wy\u017cszego","doi-asserted-by":"publisher","award":["02\/040\/BK_20\/0002"],"award-info":[{"award-number":["02\/040\/BK_20\/0002"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper introduces a new concept to solve car sequencing problem called the Car Sequencing Problem 4.0, focuses the paint shop. The problem of effective car sequencing in the paint shop is caused by the specifics of the production process itself and the structure of the production line. Sequencing of cars as required by the painting process is justified economically. The main goal is to minimize the number of costly changeovers of the painting guns because of color changes and to synchronize those with periodic cleanings, forced by technological requirements. For this purpose, a buffer located in the paint shop is applied. In this paper a game theoretic framework is presented to analyze the problem. Three games are introduced: Buffer Slot Assignment Game\u2013Buffer-OutShuttle Game called the BSAG-BOSG, In\u2013Out Shuttle Game and its modification called modified In\u2013Out Shuttle Game. Based on the simulations performed the efficiency of the algorithms is verified using several datasets.<\/jats:p>","DOI":"10.1007\/s10845-023-02079-3","type":"journal-article","created":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T08:02:16Z","timestamp":1677398536000},"page":"1037-1053","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Nash equilibrium as a tool for the Car Sequencing Problem 4.0"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4065-8213","authenticated-orcid":false,"given":"Sara","family":"Bysko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2015-3453","authenticated-orcid":false,"given":"Jolanta","family":"Krystek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5698-5721","authenticated-orcid":false,"given":"Andrzej","family":"\u015awierniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,26]]},"reference":[{"key":"2079_CR1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jda.2008.05.002","volume":"8","author":"H Amini","year":"2010","unstructured":"Amini, H., Meunier, F., Michel, H., & Mohajeri, A. (2010). Greedy colorings for the binary paintshop problem. Journal of Discrete Algorithms, 8, 8\u201314.","journal-title":"Journal of Discrete Algorithms"},{"key":"2079_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jda.2010.12.003","volume":"9","author":"SD Andres","year":"2011","unstructured":"Andres, S. D., & Hochst\u00e4ttler, W. (2011). Some heuristics for the binary paint shop problem and their expected number of colour changes. Journal of Discrete Algorithms, 9, 203\u2013211.","journal-title":"Journal of Discrete Algorithms"},{"key":"2079_CR3","doi-asserted-by":"crossref","unstructured":"Ayala, D., Wolfson, O., Xu, B., Dasgupta, B., & Lin, J. (2011). Parking slot assignment games. In Proc. ACM SIGSPATIAL international conference on advances in geographic information systems (GIS 2011) (pp. 299\u2013308). ACM Press.","DOI":"10.1145\/2093973.2094014"},{"key":"2079_CR4","doi-asserted-by":"publisher","unstructured":"Bysko, S., & Krystek, J. (2018). A game theory approach for solving the new concept of car sequencing problem. In Proc. international conference on control, automation and robotics (ICCAR) ( pp. 531\u2013535). https:\/\/doi.org\/10.1109\/ICCAR.2019.8813372","DOI":"10.1109\/ICCAR.2019.8813372"},{"key":"2079_CR5","doi-asserted-by":"crossref","unstructured":"Bysko, S., & Krystek, J. (2019). Follow-up sequencing algorithm for car sequencing problem 4.0. In Proc. automation 2019. Advances in intelligent systems and computing (pp. 145\u2013154). Springer.","DOI":"10.1007\/978-3-030-13273-6_15"},{"key":"2079_CR6","doi-asserted-by":"publisher","first-page":"105546","DOI":"10.1016\/j.cie.2018.11.056","volume":"139","author":"S Bysko","year":"2020","unstructured":"Bysko, S., & Krystek, J. (2020). Automotive paint shop 4.0. Computers & Industrial Engineering, 139, 105546. https:\/\/doi.org\/10.1016\/j.cie.2018.11.056","journal-title":"Computers & Industrial Engineering"},{"key":"2079_CR7","first-page":"1207","volume":"2","author":"J Cheng","year":"1999","unstructured":"Cheng, J., Lu, Y., Puskorius, G., Bergeon, S., & Xiao, J. (1999). Vehicle sequencing based on evolutionary computation. Evolutionary Computation, 2, 1207\u20131214.","journal-title":"Evolutionary Computation"},{"key":"2079_CR8","unstructured":"Chew, T. L., David, J. M., Nguyen, A., & Tourbier, Y. (1992). Solving constraint satisfaction problems with simulated annealing: The car sequencing problem revisited. In Proc. international workshop on expert system & their applications (pp. 405\u2013416)."},{"issue":"3","key":"2079_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0743-1066(95)00121-2","volume":"27","author":"Ph Codognet","year":"1996","unstructured":"Codognet, Ph., & Diaz, D. (1996). Compiling constraints in clp(FD). Journal of Logic Programming, 27(3), 185\u2013226. https:\/\/doi.org\/10.1016\/0743-1066(95)00121-2","journal-title":"Journal of Logic Programming"},{"key":"2079_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0166-218X(03)00442-6","volume":"136","author":"T Epping","year":"2004","unstructured":"Epping, T., Hochst\u00e4ttler, W., & Oertel, P. (2004). Complexity results on a paint shop problem. Discrete Applied Mathematics, 136, 217\u2013226.","journal-title":"Discrete Applied Mathematics"},{"key":"2079_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1051\/ro:2007003","volume":"40","author":"B Estellon","year":"2004","unstructured":"Estellon, B., Gardi, F., & Nouioua, K. (2004). Large neighborhood improvements for solving car sequencing problems. RAIRO Operation Research, 40, 355\u2013379.","journal-title":"RAIRO Operation Research"},{"key":"2079_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029561","volume-title":"Online algorithms\u2014The state of the art","author":"A Fiat","year":"1998","unstructured":"Fiat, A., & Woeginger, G. (1998). Online algorithms\u2014The state of the art. Springer."},{"issue":"20","key":"2079_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1108\/01443570010304242","volume":"20","author":"CA Geffen","year":"2000","unstructured":"Geffen, C. A., & Rothenberg, S. (2000). Suppliers And Environmental Innovation: The automotive paint process. International Journal of Operations and Production Management, 20(20), 166\u2013186.","journal-title":"International Journal of Operations and Production Management"},{"key":"2079_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10845-021-01804-0","volume":"33","author":"C Giannetti","year":"2022","unstructured":"Giannetti, C., & Essien, A. (2022). Towards scalable and reusable predictive models for cyber twins in manufacturing systems. Journal of Intelligent Manufacturing, 33, 441\u2013455. https:\/\/doi.org\/10.1007\/s10845-021-01804-0","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"11","key":"2079_CR15","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1057\/palgrave.jors.2601955","volume":"56","author":"M Gravel","year":"2005","unstructured":"Gravel, M., Gagne, C., & Price, W. L. (2005). Review and comparison of three methods for the solution of the car-sequencing problem. Journal of the Operational Research Society, 56(11), 1287\u20131295. https:\/\/doi.org\/10.1057\/palgrave.jors.2601955","journal-title":"Journal of the Operational Research Society"},{"key":"2079_CR16","doi-asserted-by":"crossref","unstructured":"Hartmann, S.A., & Runkler, T.A. (2008). Online optimization of a color sorting assembly buffer using ant colony optimization. In Operations research proceedings (pp. 415\u2013420). Springer.","DOI":"10.1007\/978-3-540-77903-2_64"},{"issue":"1\u20132","key":"2079_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10479-017-2663-4","volume":"264","author":"E Jahren","year":"2018","unstructured":"Jahren, E., & Ach\u00e1, R. A. (2018). A column generation approach and new bounds for the car sequencing problem. Annals of Operations Research, 264(1\u20132), 193\u2013211. https:\/\/doi.org\/10.1007\/s10479-017-2663-4","journal-title":"Annals of Operations Research"},{"key":"2079_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2016.04.019","volume":"74","author":"SS Ko","year":"2016","unstructured":"Ko, S. S., Han, Y. H., & Choi, J. Y. (2016). Paint batching problem on M-to-1 conveyor systems. Computers & Operations Research, 74, 118\u2013126.","journal-title":"Computers & Operations Research"},{"issue":"7","key":"2079_CR19","doi-asserted-by":"publisher","first-page":"462","DOI":"10.17814\/mechanik.2019.7.57","volume":"92","author":"J Krystek","year":"2019","unstructured":"Krystek, J., & Bysko, S. (2019). The follow-up control of the body sequencing process at the paint shop. Mechanik, 92(7), 462\u2013464.","journal-title":"Mechanik"},{"issue":"2","key":"2079_CR20","first-page":"730","volume":"33","author":"RJ Leonard","year":"1995","unstructured":"Leonard, R. J. (1995). From parlor games to social science: Von Neumann, Morgenstern, and the creation of game theory 1928\u20131944. Journal of Economic Literature, 33(2), 730\u2013761.","journal-title":"Journal of Economic Literature"},{"key":"2079_CR21","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1177\/0037549704047604","volume":"81","author":"DH Moon","year":"2005","unstructured":"Moon, D. H., Kim, H. S., & Song, C. (2005). A simulation study for implementing color rescheduling storage in an automotive factory. SIMULATION, 81, 625\u2013635.","journal-title":"SIMULATION"},{"key":"2079_CR22","doi-asserted-by":"publisher","first-page":"106048","DOI":"10.1016\/j.cie.2019.106048","volume":"137","author":"I Moya","year":"2019","unstructured":"Moya, I., Chica, M., & Bautista, J. (2019). Constructive metaheuristics for solving the Car Sequencing Problem under uncertain partial demand. Computers & Industrial Engineering, 137, 106048. https:\/\/doi.org\/10.1016\/j.cie.2019.106048","journal-title":"Computers & Industrial Engineering"},{"key":"2079_CR23","doi-asserted-by":"crossref","unstructured":"Nash., J. (1950). Equilibrium points in n-person games. In. Proc. of the national academy of sciences (pp. 48\u201349), 36(1).","DOI":"10.1073\/pnas.36.1.48"},{"key":"2079_CR24","doi-asserted-by":"publisher","unstructured":"Neveu, B., Trombettoni, G., & Glover, F. (2004). Id walk: A candidate list strategy with a simple diversification device. In Proc. CP\u20192004 (pp. 423\u2013437). Springer. https:\/\/doi.org\/10.1007\/978-3-540-30201-8_32","DOI":"10.1007\/978-3-540-30201-8_32"},{"key":"2079_CR25","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10845-021-01808-w","volume":"33","author":"OE Oluyisola","year":"2022","unstructured":"Oluyisola, O. E., Bhalla, S., Sgarbossa, F., & Strandhagen, J. O. (2022). Designing and developing smart production planning and control systems in the industry 4.0 era: A methodology and case study. Journal of Intelligent Manufacturing, 33, 311\u2013332. https:\/\/doi.org\/10.1007\/s10845-021-01808-w","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"2079_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00246021","volume":"2","author":"BD Parello","year":"1986","unstructured":"Parello, B. D., Kabat, W. C., & Wos, L. J. (1986). Job-shop scheduling using automated reasoning: A case study of the car sequencing problem. Journal of Automated Reasoning, 2(1), 1\u201342. https:\/\/doi.org\/10.1007\/BF00246021","journal-title":"Journal of Automated Reasoning"},{"issue":"3","key":"2079_CR27","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V. D., Nguyen, A., & Artigues, C. (2008). The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. European Journal of Operational Research, 191(3), 912\u2013927. https:\/\/doi.org\/10.1016\/j.ejor.2007.04.033","journal-title":"European Journal of Operational Research"},{"key":"2079_CR28","unstructured":"Solnon, S. (2000). Solving permutation constraint satisfaction problems with artificial ants. In Proc. ECAI\u20192000 (pp. 118\u2013122). IOS Press."},{"key":"2079_CR29","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1080\/00207540310001646821","volume":"42","author":"S Spieckermann","year":"2004","unstructured":"Spieckermann, S., Gutenschwager, K., & Vo\u00df, S. (2004). A sequential ordering problem in automotive paint shops. International Journal of Production Research, 42, 1865\u20131878.","journal-title":"International Journal of Production Research"},{"key":"2079_CR30","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Stutzle","year":"2000","unstructured":"Stutzle, T., & Hoos, H. H. (2000). MAX-MIN ant system. Future Generation Computer Systems, 16, 889\u2013914.","journal-title":"Future Generation Computer Systems"},{"key":"2079_CR31","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1080\/00207543.2014.948970","volume":"53","author":"H Sun","year":"2015","unstructured":"Sun, H., Fan, S., Shao, X., & Zhou, J. (2015). A colour-batching problem using selectivity banks in automobile paint shops. International Journal of Production Research, 53, 1124\u20131142.","journal-title":"International Journal of Production Research"},{"key":"2079_CR32","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jmsy.2017.04.019","volume":"44","author":"H Sun","year":"2017","unstructured":"Sun, H., & Han, J. (2017). A study on implementing color-batching with selectivity banks in automotive paint shops. Journal of Manufacturing Systems, 44, 42\u201352.","journal-title":"Journal of Manufacturing Systems"},{"issue":"4","key":"2079_CR33","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s13675-014-0023-6","volume":"2","author":"D Thiruvady","year":"2014","unstructured":"Thiruvady, D., Ernst, A. T., & Wallace, M. (2014). A Lagrangian-ACO Matheuristic for Car Sequencing. EURO Journal on Computational Optimization, 2(4), 279\u2013296. https:\/\/doi.org\/10.1007\/s13675-014-0023-6","journal-title":"EURO Journal on Computational Optimization"},{"key":"2079_CR34","doi-asserted-by":"crossref","unstructured":"Thiruvady, D., Meyer, B., & Ernst, A. (2011). Car sequencing with constraint-based ACO. In Proc. of the 13th annual conference on genetic and evolutionary computation (pp. 163\u2013170). New York, USA, ACM.","DOI":"10.1145\/2001576.2001599"},{"key":"2079_CR35","unstructured":"Valdondo, J.B., & Gude, J.P. (2007). Sequencing JIT mixed model assembly lines under station-load and part-usage constraints using lagrangean relaxations. In Proc. 3rd multidisciplinary international conference on scheduling: Theory and applications (MISTA 2007) (pp. 550\u2013552)."},{"key":"2079_CR36","volume-title":"Theory of games and economic behavior","author":"J von Neumann","year":"1944","unstructured":"von Neumann, J., & Morgenstern, O. (1944). Theory of games and economic behavior. Princeton University Press."},{"key":"2079_CR37","doi-asserted-by":"crossref","unstructured":"Xu Y., & Zhou, J. G. (2016). A virtual resequencing problem in automobile paint shops. In Proc. 22nd international conference on industrial engineering and engineering management 2015: Core theory and applications of industrial engineering (pp. 71\u201380). Atlantis Press.","DOI":"10.2991\/978-94-6239-180-2_8"},{"key":"2079_CR38","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s11771-018-3739-2","volume":"25","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Gao, L., & Wen, L. (2018). A hybrid algorithm based on tabu search and large neighbourhood search for car sequencing problem. Journal of Central South University., 25, 315\u2013330. https:\/\/doi.org\/10.1007\/s11771-018-3739-2","journal-title":"Journal of Central South University."},{"key":"2079_CR39","doi-asserted-by":"publisher","unstructured":"Zufferey, N., Studer, M., & Silver, E.A. (2006). Tabu search for a car sequencing problem. In Proc. 19th International Florida Artificial Intelligence Research Society conference (FLAIRS 2006) (pp. 457\u2013462). The AAAI Press. https:\/\/doi.org\/10.1007\/978-3-319-23350-5_8","DOI":"10.1007\/978-3-319-23350-5_8"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-023-02079-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10845-023-02079-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-023-02079-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T19:06:46Z","timestamp":1709147206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10845-023-02079-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,26]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["2079"],"URL":"https:\/\/doi.org\/10.1007\/s10845-023-02079-3","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,26]]},"assertion":[{"value":"30 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}