位置:成果数据库 > 期刊 > 期刊详情页
带组换装时间的单机调度问题
  • 期刊名称:北京科技大学学报,2009,31(10):1347-1350. (EI)
  • 时间:0
  • 分类:F224.3[经济管理—国民经济]
  • 作者机构:[1]北京科技大学经济管理学院,北京100083, [2]清华大学自动化系,北京100084
  • 相关基金:国家自然科学基金资助项目(No.70872010)
  • 相关项目:面向敏捷供应链的知识服务体系及管理策略研究
中文摘要:

在某钢铁线材企业的实际调度问题的基础上,研究了一类带有组换装时间的单机调度问题.根据该调度问题的实际需求,以最小化作业的最大延迟为优化目标.由于该问题是NP难的,提出了一类启发式算法来求解该问题,并进一步通过引入问题的性质,提高算法的寻优性能,降低算法运行时间.该算法在随机产生的测试问题和企业的实际调度上均进行了测试,实验结果表明该启发式算法能在短时间内获取近优解.

英文摘要:

A single machine scheduling problem with family setup time was studied to solve the real-life scheduling problem in a steel wire factory. According to the requirements of the real problem, the maximum lateness was minimized. As the problem is NP- hard, a heuristic algorithm was proposed to solve the problem. The problem' s characteristics were introduced into the algorithm t9 improve the search efficiency and running time. The proposed algorithm was tested both on randomly generated problems and on reallife scheduling problems from the workshop. The results show that the proposed algorithm can obtain a near optimal solution in a short time.

同期刊论文项目
同项目期刊论文