上海大学学报(自然科学版) ›› 2016, Vol. 22 ›› Issue (6): 793-803.doi: 10.3969/j.issn.1007-2861.2015.05.008

• 管理科学 • 上一篇    下一篇

不确定条件下基于遗传算法的作业车间调度问题

彭运芳1, 高雅1, 夏蓓鑫2   

  1. 1. 上海大学管理学院, 上海 200444;
    2. 上海大学机电工程与自动化学院, 上海 200072
  • 收稿日期:2015-05-25 出版日期:2016-12-30 发布日期:2016-12-30
  • 通讯作者: 夏蓓鑫(1984—), 男, 博士, 研究方向为系统调度、系统建模分析. E-mail: bxxia@shu.edu.cn
  • 作者简介:夏蓓鑫(1984—), 男, 博士, 研究方向为系统调度、系统建模分析. E-mail: bxxia@shu.edu.cn
  • 基金资助:

    国家自然科学基金资助项目(51405283, 71401098)

Job shop scheduling with uncertainty based on genetic algorithm

PENG Yunfang1, GAO Ya1, XIA Beixin2   

  1. 1. School of Management, Shanghai University, Shanghai 200444, China;
    2. School of Mechatronics Engineering and Automation, Shanghai University, Shanghai 200072, China
  • Received:2015-05-25 Online:2016-12-30 Published:2016-12-30

摘要:

考虑到产品不同的交货期, 研究了不确定条件下的作业车间调度问题, 用三角模糊数表示产品处理时间, 建立了调度问题的模型, 并结合模糊理论设计了一种改进的遗传算法进行求解. 该算法通过整数编码的方法产生初始种群, 结合轮盘赌方法和精英保留策略进行选择操作, 采用基于优先工序交叉(precedence operation crossover, POX)算子和互换变异方法进行交叉和变异操作, 并通过动态调整交叉概率和变异概率的方法来提高算法的性能以及计算效率. 最后, 通过算例和企业实例验证了该模型和算法的有效性.

关键词:  不确定性 ,  不同交货期窗口 ,  提前/拖期 ,  遗传算法, 作业车间调度

Abstract:

A mathematical model representing uncertain processing time by triangular fuzzy number was built to deal with the job shop scheduling problem with different due date windows. An improved genetic algorithm was developed to solve the problem. The algorithm generated initial population using an integer coding method combined with a roulette method and the elitist strategy in the selection operator. Precedence operation crossover (POX) and swap mutation methods were used in crossover and mutation operators. Meanwhile, crossover and mutation probabilities were dynamically adjusted to improve the algorithm’s performance. An example was given to verify validity of the model and algorithm.

Key words: genetic algorithm,  different due date window ,  earliness/tardiness ,  uncertainty , job shop scheduling