Abstract

The paper presents the approach to the car buffering problem in the paint shop from the perspective of modern industrial plant requirements. The control of buffering process is connected with sequencing problem. A sequence, in which car bodies are painted is particularly important, because the minimization of the number of painting guns changeovers results in minimizing production costs. The problem of car sequencing has been widely considered in the literature. However, a large number of assumptions and simplifications, made by the researchers, make it impossible to apply developed solutions in practice. The paper considers the car sequencing issue taking into account problems that occur on the production line in the real paint shop. After presenting the algorithm, used in the analyzed plant, four sequencing algorithms, used to define the output sequence from the buffer, are discussed. Two algorithms are modifications of the well known scheduling heuristics – that are SPT and LPT methods. Based on these rules and follow-up control idea two new algorithms are proposed. The input sequence is determined in one of two ways. The correctness of the car body buffer control in the paint shop was verified in the test carried out using innovative method – virtual commissioning. The aim of the research was to identify the most effective methods that will be developed in the future. During tests, the buffer flow was monitored in order to identify unfavorable buffering situations deemed unacceptable in real conditions. The most unfavorable cases are presented and discussed in the article.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call