【摘要】 研究了钢铁企业冷轧原料库中的吊机调度问题.将吊机的运输和倒垛操作集成考虑,目标函数为将全部需求板卷运输到指定位置的时间最小化.对于该问题,首先提出了一个混合整规划模型,进一步证明了该问题是强NP难的.基于对问题性质的分析,针对无倒垛操作的特殊情况,提出了多项式时间可解的最优算法.对于问题的一般情况,提出了一个启发式算法并分析了它的最坏情况.更多还原

【Abstract】 The crane scheduling problem which is motivated by cooled-rolling material warehouse in iron and steel enterprise is studied.Considering the transportation and shifting simultaneously,the objective function is to minimize the time of transporting all demand coils to a specified location.For this problem,a mixed integer programming model is proposed,which further proofs that the problem is strongly NP-hard.Based on some analytical properties,apolynomial-time optimal algorithmis proposed for solving a special case that no shuffling operation happens,and furthermore a heuristic algorithm is developed for solving general case,respectively.The performance is analyzed from worst-case point of view.更多还原