Production scheduling problem in a factory of automobile component primer painting

Abstract

In a factory of automobile component primer painting, various automobile parts are attached to overhead hangers in a conveyor line and undergo a series of coating processes. Thereafter, the components are wrapped at a packaging station. The packaging process should be fully balanced by an appropriate sequence of components to prevent the bottleneck effect because each component requires different packaging times and materials. An overhead hanger has a capacity limit and can hold varying numbers of components depending on the component type. Capacity loss can occur if the hanger capacity is not fully utilized. To increase hanger utilization, companies sometimes mix two or more component types on the same hangers, and these hangers are called mixed hangers. However, mixed hangers generally cause heavy workload because different items require additional setup times during hanging and packing processes. Hence, having many mixed hangers is not recommended. A good production schedule requires a small number of mixed hangers and maximizes hanger utilization and packaging workload balance. We show that the scheduling problem is NP-hard and develop a mathematical programming model and efficient solution approaches for the problem. When applying the methods to solve real problems, we also use an initial solution-generating method that minimizes the mixing cost, set a rule for hanging the items on hangers considering eligibility constraint, and decrease the size of tabu list in proportion to the remaining computational time for assuring intensification in the final iterations of the search. Experimental results demonstrate the effectiveness of the proposed approaches.

A Model for Developing Existing Ports Considering Economic Impact and Network Connectivity

“…We solved our proposed models using the CPLEX 12.9 commercial solver that has been used in many previous studies [51][52][53], including the ones that provided solutions for real company problems. Our codes are written in Python language with Python 3.7 version in the Microsoft Visual Studio Community Edition 2019 platform.…”

Optimizing Painting Sequence Scheduling Based on Adaptive Partheno-Genetic Algorithm

“…In order to meet the above constraint (8), the other topcoat j 2 = j 1 on the (k + 1)-th skid cannot be arranged, and the expression 2 is equal to 0. Inequality (9) demonstrates that one empty skid can often be placed between two consecutive painting tasks.…”

“…A capacity limitation and a type restriction of overhead hangers were considered in reference [9]. A mixed-integer programming model for the scheduling problem was developed.…”

Industrial robot programming by demonstration using stereoscopic vision and inertial sensing

“…painting, polishing or flaming. Commonly, in these industrial applications, human craftsmanship needs to be precisely imitated and the available commercial robot programming solutions, based on highly advanced teach pendants and simulation software, fall short to deliver, affecting the large-scale adoption of industrial robots in many industrial sectors (Ghahramani et al, 2019;Singgih et al, 2020).…”