Abstract

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–Buffer-OutShuttle Game called the BSAG-BOSG, In–Out Shuttle Game and its modification called modified In–Out Shuttle Game. Based on the simulations performed the efficiency of the algorithms is verified using several datasets.

中文翻译：

---

纳什均衡作为汽车排序问题 4.0 的工具

摘要

本文介绍了一种解决汽车排序问题的新概念，称为汽车排序问题4.0，重点关注涂装车间。涂装车间有效的汽车排序问题是由生产工艺本身的特殊性和生产线的结构造成的。根据喷漆过程的要求对汽车进行排序在经济上是合理的。主要目标是最大程度地减少因颜色变化而导致的昂贵的喷枪更换次数，并根据技术要求将其与定期清洁同步。为此，使用位于喷漆车间的缓冲器。本文提出了一个博弈论框架来分析该问题。介绍了三种游戏：缓冲槽分配游戏-缓冲输出穿梭游戏（BSAG-BOSG）、进出穿梭游戏（In-Out Shuttle Game）及其修改版（称为改进的进出穿梭游戏）。基于所进行的模拟，使用多个数据集验证了算法的效率。