Abstract
The problem of effective car sequencing in the paint shop results from the specifics of production process itself and from the structure of production line. Sequencing of cars intended to painting process is justified by economic reasons. The paper describes the new concept of this problem – Car Sequencing Problem 4.0, which takes into account the real structure of paint shop and buffers used there. The main goal of the research is to minimize the number of costly changeovers of painting guns, which results only from painting color changes. Each color change is related to the need to clean paint system, loss of paint and gun changeover, which increases production cost. The aim should be synchronization of changeovers, resulting from color changes, with periodic cleanings of painting guns, forced by technological requirements. Periodic cleanings are made to ensure good quality of painting process. In the paper the Follow-up Sequencing Algorithm is proposed to solve the considered sequencing problem. The purpose of the conducted research was to verify the influence of periodic cleaning interval on the effectiveness of the presented sequencing algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alszer, S., Krystek, J., Bysko, S.: Complex approach to the control of car body buffering in the paint shop. In: Szewczyk, R., Zieliński, C., Kaliczyńska, M. (eds.) Automation 2018. Advances in Automation, Robotics and Measurement Techniques, vol. 743 of AISC, pp. 152–161. Springer, Berlin (2018). https://doi.org/10.1007/978-3-319-77179-3_14
Fiat, A., Woeginger, G.: Online Algorithms—The State of the Art. Springer, Berlin (1998)
Hartmann, S.A., Runkler, T.A.: Online optimization of a color sorting assembly buffer using ant colony optimization. In: Kalcsics, J., Nickel, S. (eds.) Operations Research Proceedings, vol. 2007, pp. 415–420. Springer, Heidelberg (2008)
Krystek, J., Alszer, S.: Contemporary aspects of car sequencing problem in a paint shop. Mechanik 7, 527–529 (2017). https://doi.org/10.17814/mechanik.2017.7.67
Ko, S.S., Han, Y.H., Choi, J.Y.: Paint batching problem on M-to-1 conveyor systems. Comput. Oper. Res. 74, 118–126 (2016)
Moon, D.H., Kim, H.S., Song, C.: A simulation study for implementing color rescheduling storage in an automotive factory. Simulation 81, 625–635 (2005)
Spieckermann, S., Gutenschwager, K., Voß, S.: A sequential ordering problem in automotive paint shops. Int. J. Prod. Res. 42, 1865–1878 (2004)
Sun, H., Fan, S., Shao, X., Zhou, J.: A colour-batching problem using selectivity banks in automobile paint shops. Int. J. Prod. Res. 53, 1124–1142 (2015)
Acknowledgement
This work has been supported by Polish Ministry of Science and Higher Education under internal grants 02/010/BK_18/0102 and BKM-2018 for Institute of Automatic Control, Silesian University of Technology, Gliwice, Poland and by the company ProPoint Sp. z o.o. Sp. K.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Bysko, S., Krystek, J. (2020). Follow-Up Sequencing Algorithm for Car Sequencing Problem 4.0. In: Szewczyk, R., Zieliński, C., Kaliczyńska, M. (eds) Automation 2019. AUTOMATION 2019. Advances in Intelligent Systems and Computing, vol 920. Springer, Cham. https://doi.org/10.1007/978-3-030-13273-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-13273-6_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-13272-9
Online ISBN: 978-3-030-13273-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)