Please submit manuscripts in either of the following two submission systems

    ScholarOne Manuscripts

  • ScholarOne
  • 勤云稿件系统

  • 登录

Search by Issue

  • 2024 Vol.31
  • 2023 Vol.30
  • 2022 Vol.29
  • 2021 Vol.28
  • 2020 Vol.27
  • 2019 Vol.26
  • 2018 Vol.25
  • 2017 Vol.24
  • 2016 vol.23
  • 2015 vol.22
  • 2014 vol.21
  • 2013 vol.20
  • 2012 vol.19
  • 2011 vol.18
  • 2010 vol.17
  • 2009 vol.16
  • No.1
  • No.2

Supervised by Ministry of Industry and Information Technology of The People's Republic of China Sponsored by Harbin Institute of Technology Editor-in-chief Yu Zhou ISSNISSN 1005-9113 CNCN 23-1378/T

期刊网站二维码
微信公众号二维码
Related citation:Binghai Zhou,Jiaying Gu.An Optimization Method for a Single Machine Multi-family Scheduling Problem with Qualification Run Constraints[J].Journal of Harbin Institute Of Technology(New Series),2018,25(2):24-32.DOI:10.11916/j.issn.1005-9113.16169.
【Print】   【HTML】   【PDF download】   View/Add Comment  Download reader   Close
←Previous|Next→ Back Issue    Advanced Search
This paper has been: browsed 3319times   downloaded 670times 本文二维码信息
码上扫一扫!
Shared by: Wechat More
An Optimization Method for a Single Machine Multi-family Scheduling Problem with Qualification Run Constraints
Author NameAffiliation
Binghai Zhou School of Mechanical Engineering, Tongji University, Shanghai 201804, China 
Jiaying Gu School of Mechanical Engineering, Tongji University, Shanghai 201804, China 
Abstract:
The qualification run (qual-run) as a technique to avoid possible quality problems of products inevitably leads to much longer cycle time. To effectively balance the trade-off between the qual-run and setup times, a scheduling model of a single machine with multiple families was developed and an adaptive differential evolution algorithm based on catastrophe with depth neighborhood search was applied to resolve the problem. First, a scheduling problem domain was described, and a mathematical programming model was set up with an objective of minimizing makespan. Further, several theorems were developed to construct feasible solutions. On the basis of differential evolution, the depth neighborhood search operator was adopted to search a wide range of solutions. In addition, the adaptive process and catastrophe theory were combined to improve the performance of the algorithm. Finally, simulation experiments were carried out and the results indicated that the proposed algorithm was effective and efficient.
Key words:  setup  qual-run  multi-family  scheduling  hybrid differential evolution algorithm
DOI:10.11916/j.issn.1005-9113.16169
Clc Number:TP391
Document Code::A
Fund:
Descriptions in Chinese:
  

考虑设备资格约束的单机多产品族问题调度优化

周炳海,顾佳颖

(同济大学 机械与能源工程学院,上海 201804)

创新点说明:

除考虑传统的换模外,考虑控制产品质量的设备资格验证过程,建立数学模型,提出产生可行解的性质、定理,以减少算法的搜索空间,并构建一种基于差分进化的自适应混合灾变算法,并证明其优于已有算法。

研究目的:

为控制产品质量的同时减少产品完工时间,构建一种高效的算法以寻找设备资格验证和换模次数之间的平衡点。

研究方法:

1)问题描述及数学建模:复杂系统调度理论,运筹学理论,约束理论;

2)算法构造:进化算法,启发式规则,定理构造推导;

3)实验分析:敏感性分析、数值仿真实验、对比实验

结果:

1) 通过实验验证了设备资格验证时间对调度造成的影响,当设备资格验证时间越长,换模次数和设备资格验证次数之间的权衡对调度的影响也越大;

2)与差分进化算法对比发现,引入自适应灾变算子及邻域搜索算子后的差分进化算法性能更优,执行速度更快;

3)与已有的解决此类问题的结构式算法相比,该改进后的算法不论在算法时间还是性能上都具有明显的竞争力。

结论:

设备资格验证时间会对调度造成影响,所提出的基于差分进化的自适应混合灾变算法可有效解决考虑设备资格验证时间的单机调度问题,并且其性能优于已有算法,这为解决相似调度问题提供了技术上的支持和借鉴。

关键词:换模;设备资格验证;多产品族;调度;混合差分进化算法

LINKS