Production scheduling problem in a factory of automobile component primer painting
SCIE
SCOPUS
- Title
- Production scheduling problem in a factory of automobile component primer painting
- Authors
- Singgih, Ivan Kristianto; Yu, Onyu; Kim, Byung-In; Koo, Jeongin; Lee, Seungdoe
- Date Issued
- 2020-01
- Publisher
- SPRINGER
- 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.
- Keywords
- Automobiles; Heuristic algorithms; Heuristic programming; Integer programming; Packaging; Packaging materials; Production control; Scheduling; Scheduling algorithms; Tabu search; Automobile components; Bottleneck effects; Computational time; Flow-shop scheduling; Mathematical programming models; Mixed integer programming; Production schedule; Production scheduling problems; Coatings
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/101075
- DOI
- 10.1007/s10845-019-01524-6
- ISSN
- 0956-5515
- Article Type
- Article
- Citation
- JOURNAL OF INTELLIGENT MANUFACTURING, 2020-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.