Please wait a minute...
工程设计学报
Chinese Journal of Engineering Design  2010, Vol. 17 Issue (6): 406-409    DOI:
    
Study of job shop scheduling algorithm based on axiomatic design
 ZHENG  Xiong-Wen, JIN  Ya-Wei
Department of Electromechanical Engineering, Nanyang Institute of Technology, Nanyang 473004, China
Download: HTML     PDF(948KB)
Export: BibTeX | EndNote (RIS)      

Abstract   Job shop scheduling (JSS) is a representative NP question and coupling complicated system. JSS based on axiomatic design was presented and analyzed in detail, such as system decoupling design, approach of decoupling, decoupling matrix, scheduling algorithm and the complexity of the algorithm. The actual production scheduling shop was taken as a research object, and the authors have given machining parts weights based on the urgency situation of parts to be processed, with giving priority to the parts which needs longer working hours in scheduling process. The general objective was decoupling, with optimized compression processing time to meet the constraint condition. Because different weights were sent to the non-manufactured parts, the algorithm would be more conformed to the reality of enterprise. The result of the analysis to the algorithm complexity turns out that this algorithm belongs to three time multinomial complex levels, which surpasses the general algorithm. Two instances are presented to show the practicability and validity of the algorithm.

Key words：  axiomatic design      job shop scheduling      heuristic algorithm     
Published: 28 December 2010
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
ZHENG Xiong-Wen
JIN Ya-Wei
Cite this article:

ZHENG Xiong-Wen, JIN Ya-Wei. Study of job shop scheduling algorithm based on axiomatic design. Chinese Journal of Engineering Design, 2010, 17(6): 406-409.

URL:

https://www.zjujournals.com/gcsjxb/     OR     https://www.zjujournals.com/gcsjxb/Y2010/V17/I6/406


基于公理设计的车间调度算法研究

车间调度问题是典型的NP难题,也是一种完全耦合的复杂系统.基于公理设计思想对车间调度系统进行了解耦设计,给出了相应的解耦思路及解耦矩阵,提出并实现了一种车间调度算法,并对算法的复杂性进行了分析.以实际车间生产调度作为研究对象,针对实际生产中零件紧急程度不一的情况,为待加工零件赋予不同的权值,并优先考虑调度加工工时较长的零件；采用以解耦设计为总目标,在满足约束条件的情况下,尽量优化压缩加工时间.对算法的复杂性进行了分析,该算法属于三次多项式复杂级,较优于一般的算法.通过2个实例计算和对比,验证了本算法的实用性和有效性.

关键词： 公理设计,  车间调度,  启发式算法 
[1] TANG Dong-lin, LONG Zai-yong, TANG Yan-jin, PAN Feng, YOU Chuan-kun. Complete coverage path planning of oil tank detection wall climbing robot[J]. Chinese Journal of Engineering Design, 2020, 27(2): 162-171.
[2] SHI Guo-Hong, CHEN Jing-Xian, MA Han-Wu, CHEN Li-Qing. Optimization scheduling research of multi-resource-constrained project based on mixed-intelligence algorithm[J]. Chinese Journal of Engineering Design, 2008, 15(2): 140-144.