东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2006, Vol. 27 ›› Issue (2): 150-152.DOI: -

• 论著 • 上一篇    下一篇

钢铁企业生产与运输费用协调调度问题

关静;唐立新;   

  1. 东北大学教育部暨辽宁省流程工业综合自动化重点实验室;东北大学信息科学与工程学院 辽宁沈阳110004;辽宁沈阳110004
  • 收稿日期:2013-06-23 修回日期:2013-06-23 出版日期:2006-02-15 发布日期:2013-06-23
  • 通讯作者: Guan, J.
  • 作者简介:-
  • 基金资助:
    国家杰出青年科学基金资助项目(70425003);;

Coordinated machine scheduling and conveyance problems of a steel works

Guan, Jing (1); Tang, Li-Xin (2)   

  1. (1) Key Laboratory of Process Industry Automation of Liaoning Province, Northeastern University, Shenyang 110004, China; (2) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2006-02-15 Published:2013-06-23
  • Contact: Guan, J.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

435

摘要： 针对钢铁企业生产前存在不可忽略运输的实际,研究了生产与生产前运输费用协调调度问题.由于钢铁企业被调度的工件体积较大及加工前不能等待太长的时间,因此运输车辆的容量及工件在机器前的缓冲等待时间有限制.考虑的机器环境为单机环境,单机前有无限的缓冲空间,运输车辆数目无限,调度的目标函数为传统的调度函数加上运输费用.对于不同的目标函数,证明了工件在单机加工前缓冲等待时间有限制的调度问题是强NP难的,对于运输车辆有容量限制问题的可解情况给出了多项式时间算法.

关键词: 调度, 协调, 运输, 等待时间, NP难

Abstract: The objective to study on is to minimize the overall cost of both production and in-situ conveyance that should not be ignored in the supply chain scheduling of a steel works. Limited capacity of transporters and limited waiting time of jobs before their processing should be taken into account. To simplify the problem, it is assumed that the machine to use is just a single machine on which the job to be processed has limited time to await with unlimited number of transporters ready for use. Thus, the objective function for scheduling becomes the conventional scheduling function plus conveyance cost. For different objective function, the problem of scheduling is proved strongly NP-hard if a job has limited waiting time before processed on a single machine. As to the solvable case that the capacity of transporters is limited, some polynomial time algorithms are given.

中图分类号: