系统仿真学报 ›› 2019, Vol. 31 ›› Issue (5): 919-924.doi: 10.16182/j.issn1004731x.joss.17-0150

• 仿真应用工程 • 上一篇    下一篇

带恶化工件的不相关并行机调度优化

轩华1, 秦莹莹1, 王薛苑1, 张百林2   

  1. 1.郑州大学管理工程学院,河南 郑州 450001;
    2.浪潮电子信息产业股份有限公司,山东 济南 250101
  • 收稿日期:2017-04-10 修回日期:2017-07-09 出版日期:2019-05-08 发布日期:2019-11-20
  • 作者简介:轩华(1979-),女,河南睢县,博士,教授,研究方向为物流优化与控制等。
  • 基金资助:
    国家自然科学基金(U1604150, U1804151),教育部人文社会科学研究(15YJC630148),郑州大学优秀青年教师发展基金(1421326092),河南省高等学校重点项目(17A520058)

Optimization for Unrelated Parallel Machine Scheduling with Deteriorating Jobs

Xuan Hua1, Qin Yingying1, Wang Xueyuan1, Zhang Bailin2   

  1. 1.School of Management Engineering, Zhengzhou University, Zhengzhou 450001, China;
    2.Inspur Electronic Information Industry Co., Ltd, Ji’nan 250101, China;
  • Received:2017-04-10 Revised:2017-07-09 Online:2019-05-08 Published:2019-11-20

摘要: 研究了以最小化最大完工时间为目标的不相关并行机环境下带恶化工件的车间调度问题,工件的加工时间随着开始时间的不同而改变,将其表示为开始时间的增函数,假设每个工件在不同机器上有各自的恶化系数。针对该NP-hard问题,建立数学规划模型,设计基于两段式编码和遗传参数自适应调节策略的改进遗传算法以合理地进行工件排序及机器分配。通过测试不同规模问题的仿真实验,对比结果表明所设计的算法在求解时间和求解质量上均具有较大优势。

关键词: 最大完工时间, 不相关并行机调度, 恶化工件, 两段式编码, 自适应策略

Abstract: Unrelated parallel machine scheduling problem with deteriorating jobs is studied with the objective of minimizing the maximum completion time. The processing time of a job varies with its beginning time which is denoted as an increasing function of its starting time. It is assumed that each job has its own different deterioration rate on each machine. A mathematical programming model is formulated for the NP-hard problem. An improved genetic algorithm based on two segment coding and self-adaptive adjustment of genetic parameters is then designed to make job scheduling and machine allocation more reasonable. Through the simulation experiments of different sized problems, the results show that the proposed algorithm has more advantages in both resolution time and solution quality.

Key words: maximum completion time, unrelated parallel machines scheduling, deteriorating jobs, two segment coding, self-adaptive strategy

中图分类号: