A Research of Resequencing Problem in Automobile Paint Shops Using Selectivity Banks

摘要：

The resequencing operations of using selectivity banks in automobile paint shops is studied in this paper. A 0-1 integer programming model is formulated to describe the process. The objective of the proposed model is to minimize the number of color changes in a car sequence after sorting. A nested ant colony optimization heuristic is developed to find near-optimal solutions. Computational experiments are conducted to evaluate the performance of the presented algorithm. It is shown that the proposed algorithm can effectively and efficiently solve the resequencing problem within reasonable time duration.

作者: Long LIN Hui SUN Ying-qiu XU

作者单位: School of Mechanical Engineering, Southeast University, Nanjing, China

会议类型: 国际会议

会议名称: 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management(2011 IEEE 第十八届工业工程与工程管理国际会议 IEEM2011)

会议地点: 长春

会议语种:英文

页码: 658-662

在线出版日期: 2011-09-03（万方平台首次上网日期，不代表论文的发表时间）