Two Metaheuristic Methods for the Order Scheduling in the Steel Industry
In this paper we investigate an order scheduling problem that arises from the color painting line (CPL) in Baosteel. The objective of the problem is to reduce the inventory level and changeover cost between orders processed adjacently on CPL by effectively coordinating relative operations belonging to interior production supply chain in Baosteel. The problem can be formulated as a Vehicle Routing Problem with Time Windows and Batch Delivery (VRPTWBD). We present a tabu search algorithm and a heuristic algorithm based on variable neighborhood search to solve the VRPTWBD. Comparisons of results of two algorithms with manual schedules indicate that both algorithms are attractive and lead to better solutions than solution provided without coordinating relative operations. A decision support system imbedded the VNS based heuristic has been used for several years in Baosteel.
Cong Gao Lixin Tang
The logistics institute Northeastern University Shenyang, 110000
国际会议
南宁
英文
2007-07-20（万方平台首次上网日期，不代表论文的发表时间）