摘要
研究了钢铁企业热轧工序的生产调度问题·对于热轧调度，传统的研究和开发方法是采用串行策略：一个班次内的轧制单元计划是依次制定的·这种串行策略实质是一个贪婪程序，所以可能导致局部最优·与这个串行策略相反，从全局最优观点提出了一个并行策略：能够同时产生一个班次中的Ｍ个轧制单元计划·使用并行策略，基于实际生产约束的热轧调度问题可以作为一个多旅行商模型·为了求解这个问题，多旅行商模型变换为单旅行商模型·
The problem of scheduling hot rolling operations in iron and steel plants is studied. Traditional research and development methods for hot rolling scheduling usually adopt a serial strategy in which turns in a shift are sequentially formed. This serial strategy is essentially a greedy procedure. Therefore,the serial strategy suffers from the disadvantage of local optimization. Contrast to this serial strategy,a parallel strategy is adopted to simultaneously produce M turns in a shift from the global optimal view is proposed. Using the proposed parallel strategy, hot rolling scheduling problem is modeled as a multiple traveling salesman problem (MTSP) based on actual production constraints. To solve the problem,the MTSP model is then converted into a single traveling salesman problem (TSP) model.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
1999年第2期148-150,共3页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金
国家"八六三"高技术CIMS主题项目
中国科学院机器人学开放实验室资助
辽宁省博士启动资金支持项目
关键词
热轧生产
调度
多旅行商模型
并行处理
iron and steel industry,hot rolling production,scheduling,multiple traveling salesman problem.
