期刊文献+

数据挖掘算法在作业车间调度问题中的应用 被引量:1

Application of data mining algorithm in job shop scheduling problem
下载PDF
导出
摘要 为了从与日俱增的车间生产数据中提取调度规则来指导生产调度任务,提出一种基于数据挖掘的调度算法。将最小化最大完工时间设置为性能指标,从作业车间的离线生产数据中建立合适的调度样本集;将建立的调度样本集按合适的比例分为训练集和测试集;用数据挖掘算法中的分类回归树(CART)从训练集中获取有效的调度知识,形成CART树状调度规则库;为了验证所得调度规则的有效性,将调度规则与遗传算法结合,设计了一种基于数据挖掘和调度规则的遗传算法作为调度算法来求解作业车间调度问题。通过对不同作业车间经典算例进行仿真与测试,验证了所提调度规则和调度算法的有效性与优越性。 To extract dispatching rules from the ever-increasing workshop production data for guiding production scheduling tasks,a scheduling algorithm based on data mining was proposed.The minimize maximum completion time was set as the performance indicator,and a suitable scheduling sample set from the offline production data of the job shop was established.The established scheduling sample set was divided into training set and test set according to an appropriate ratio;then,the Classification and Regression Tree(CART)in the data mining algorithm was used to obtain effective scheduling knowledge from the training set,and a CART tree dispatching rule library was formed.To verify the effectiveness of the obtained dispatching rules,the obtained dispatching rules were combined with the genetic algorithm,and a genetic algorithm based on data mining and dispatching rules was designed as a scheduling algorithm to solve the job shop scheduling problem.Through the simulation and testing of different job shop classic examples,the effectiveness and superiority of the extracted dispatching rules and the scheduling algorithm were verified.
作者 王艳红 赵也践 刘文鑫 WANG Yanhong;ZHAO Yejian;LIU Wenxin(School of Artificial Intelligence,Shenyang University of Technology,Shenyang 110870,China)
出处 《计算机集成制造系统》 EI CSCD 北大核心 2024年第2期520-536,共17页 Computer Integrated Manufacturing Systems
基金 辽宁省重点研发计划资助项目(2020JH2/10100041) 国家自然科学基金青年基金资助项目(62003221)。
关键词 数据挖掘 作业车间调度 分类回归树 调度规则 data mining job shop scheduling classification and regression tree dispatching rules
  • 相关文献

参考文献6

二级参考文献73

  • 1吴强.基于本体的领域知识表示和获取[J].计算机工程与应用,2005,41(31):23-25. 被引量:2
  • 2MEERAN S,MORSHED M S. A hybrid genetic tabusearch algorithm for solving job shop scheduling prob-lems: a case study [J]. Journal of Intelligent Manufac-turing, 2012,23(4): 1063 - 1078.
  • 3BRUCKER P,JURISCH B,SIEVERS B. A branch andbound algorithm for the job-shop scheduling problem [J].Discrete applied mathematics, 1994, 49(1) : 107 - 127.
  • 4GONCALVES J F,DE MAGALHAES MENDES J J,Resende M G C. A hybrid genetic algorithm for the jobshop scheduling problem [J]. European Journal of Oper-ational Research, 2005,167(1) : 77 - 95.
  • 5VAN LAARHOVEN P J M, AARTS E H L, Lenstra JK. Job shop scheduling by simulated annealing [J]. Op-erations Research, 1992,40(1) : 113-125.
  • 6ZHANG R,WU C. A simulated annealing algorithm basedon block properties for the job shop scheduling problem withtotal weighted tardiness objective [J]. Computers and Opera-tions Research,2011, 38(5) : 854 - 867.
  • 7NOWICKI E,SMUTNICKI C. An advanced tabusearch algorithm for the job shop problem [J], Journal.
  • 8WECKMAN G R,GANDURI C V,KOONCE D A. Aneural network job-shop scheduler [J]. Journal of Intel-ligent Manufacturing, 2008,19(2) : 191-201.
  • 9LI L,SUN Z J,NI J C, et al. Data-based schedulingframework and adaptive dispatching rule of complexmanufacturing systems [J]. The International Journalof Advanced Manufacturing Technology, 2013,66(9-12): 1891 - 1905.
  • 10KOONCE D A, TSAI S C. Using data mining to findpatterns in genetic algorithm solutions to a job shopschedule [J]. Computers and Industrial Engineering,2000,38(3): 361 - 374.

共引文献39

同被引文献8

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部