논문 상세보기
In the painting process of automotive factory, color changeover cost is incurred every time the color of vehicle is changed. To solve this problem, automotive company usually uses storage space such as Selectivity Banks(SB) or Car Rescheduling Storage and carries out sequence planning so that vehicles of the same color are consecutive, which is called Car Resequencing Problem (CRP). So far, research works for CRP has focused on algorithms finding optimal or approximated optimal solutions under the condition that the number of vehicles is fixed in SB. However, these results cannot be directly applied to the actual automotive paint shops since they have continuous flows of cars into SB to be handled in a day. Therefore, in this paper, we propose an efficient cyclic scheduling method that starts the painting process using the result of Accelerated Dynamic Programming (ADP) and then reapplies the ADP to the vehicles in SB for renewing the painting schedule whenever a certain number of vehicles is painted, represented as a threshold. To show the effectiveness of the proposed method, we performed a numerical experiment by designing system configurations, based onthe actual vehicle painting process, and proposed a good threshold that can reduce overall color changeover cost.
