| 钢卷仓库中的吊机调度问题 |
| |
| 引用本文： | 谢谢,李彦平.钢卷仓库中的吊机调度问题[J].沈阳大学学报,2014(2):159-165. |
| |
| 作者姓名： | 谢谢 李彦平 |
| |
| 作者单位： | 沈阳大学装备制造综合自动化重点实验室,辽宁沈阳110044 |
| |
| 基金项目： | 国家自然科学基金资助项目（71201104）. |
| |
| 摘 要： | 研究了钢铁企业冷轧原料库中的吊机调度问题.将吊机的运输和倒垛操作集成考虑,目标函数为将全部需求板卷运输到指定位置的时间最小化.对于该问题,首先提出了一个混合整规划模型,进一步证明了该问题是强NP难的.基于对问题性质的分析,针对无倒垛操作的特殊情况,提出了多项式时间可解的最优算法.对于问题的一般情况,提出了一个启发式算法并分析了它的最坏情况.
|
| 关 键 词： | 吊机调度 仓库 强NP难 启发式 最坏情况分析 |
Crane Scheduling in Warehouse of Coil |
| |
| Xie Xie,Li Yanping.Crane Scheduling in Warehouse of Coil[J].Journal of Shenyang University,2014(2):159-165. |
| |
| Authors: | Xie Xie Li Yanping |
| |
| Institution: | (Key Laboratory of Manufacturing Industrial and Integrated Automation, Shenyang University, Shenyang 110044, China) |
| |
| 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, a polynomial-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. |
| |
| Keywords: | crane scheduling warehouse strongly NP-hard heuristics worst-case analysis |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
