Steelmaking-Refining Scheduling Problem with Transportation Consideration
This article explores the coordinated scheduling problem between production and transportation in a steelmaking shop. Two models arising from steel-making and refining operations are considered. The first model involves processing jobs on two machine flowshop with semi-finished job transportation consideration. The objective is to minimize the maximum completion time. For the first model, we provide an approximate algorithm with worst case 2 and show the computational results. The second model considers the real production technical constraints, in which jobs are processed on identical parallel machines (steelmaking furnaces) firstly and then transported to downstream by vehicles assigned to parallel machines, finally, jobs are processed on the assigned machines (refining furnaces) downstream. The objective of the second model is to minimize the maximum completion time, and the total penalty for the waiting times and idle times on parallel machines. For the second model, we develop a tabu search algorithm and provide the computational results.
scheduling transportation coordination worst case analysis mathematical model tabu search
Jing GUAN Lixin TANG Guofen HU
The Logistics Institute,Northeastern University,Shenyang,China Baosteel Baosight Software Co Ltd,Shanghai,China
国际会议
北京
英文
2007-05-30（万方平台首次上网日期，不代表论文的发表时间）