期刊文献+

具有返工过程的动态任务调度方法 被引量:1

Scheduling method of dynamic task with rework process
在线阅读 下载PDF
导出
摘要 模具设计任务具有随机返工的典型特征,决策者无法做出最优决策,使用马尔可夫决策过程对具有返工过程的任务动态调度问题建立数学模型,由于返工需要更多的时间,导致无法在任务完工期内按时完工,研究旨在实现任务总拖期期望成本最小化为目标,在此基础上应用多种排序规则组合优先筛选行动集解决动态规划维数灾难问题,对比单一的规则表明,该方法在求解问题上具有的优越性。 The die & mould design task had the typical characteristics of random rework. The task might not be completed on time due to reworking, and the decision maker could not make the optimal decision. The Markov decision process was used to establish a mathe- matical model for the dynamic task scheduling problem with rework process. The research aimed to minimize the expected cost of the task total delay. On this basis, a combination of multiple sorting rules was applied, and the action set was preferentially selected to solve the "curse of dimensionality" of the dynamic programming. The results showed that the proposed method was superior to the single nile in solving the problem.
作者 陈武一 王小明 CHEN Wu-yi;WANG Xiao-ming(Key Laboratory of Computer Integrated Manufacturing System of Guangdong Province,Guangdong University of Technology,Guangzhou,Guangdong 510006,China)
出处 《模具工业》 2018年第11期9-14,共6页 Die & Mould Industry
关键词 动态调度 马尔科夫决策过程 多规则组合 模具设计 决策时刻 dynamic scheduling Markov decision process combination of multiple rules die & mould design decision time
作者简介 陈武一(1993-),男(汉族),湖南株洲人,硕士研究生,主要从事动态任务调度方面的研究。
  • 相关文献

参考文献4

二级参考文献32

  • 1J SUN,Y F ZHANG-A,Y C NEE.A distributed multi- agent environment for product design and manufactur- ing planning[J].Intemational Journal of Production Re- search,2001,35(1/2):117-120.
  • 2J BLAZEWICZ,J K LENSTRA,A H G R KAN.Schedul- ing subject to resource-constraints:classification and complexity[J].Discrete Applied Mathematics,1983(5):ll-24.
  • 3DEMEULAMEESTER E HERROELEN-W.A branch-and- bound procedure for the multiple resource-constrained project scheduling[J].Management Science,1992,38(12): 1803-1818.
  • 4H K ALFARES,J E BAILEY.Integrated project task and manpower seheduling[J].IIETransaetions,1997,29(9): 711-717.
  • 5O BELLENGUEZ-MORINEAU,E NERON.A branch-and- bound method for solving muhi-skillproject scheduling problem[J].RAIRO-Operations Research,2007,41 (2): 155-170.
  • 6SIMON D.Biogeography-based optimization[J].IEEE Trans- cations on Evolutionary Computation,2008(6):702-713.
  • 7W Zhiming, Z Chunwei. Genetic algorithm approach to job shop scheduling and its use in real-time cases [ J ]. Interna- tional Journal of Computer Integrated Manufacturing,2000,13(5): 422-429.
  • 8Eskandari H, Hosseinzadeh A. A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times [ J ]. Journal of The Operational Research Society, 2014, 65(8) : 1221-1231.
  • 9Ko H, Kim J, Kim S, et al. Dispatching rule for non-identi- cal parallel machines with sequence-dependent setups and quality restrictions [ J ]. Computers & Industrial Engineering, 2010, 59(3) : 448-457.
  • 10Biswas P, Sarker B R. Optimal batch quantity models for a lean production system with in-cycle rework and scrap [ J ]. International Journal of Production Research, 2008, 46 (23) : 6585-6610.

共引文献15

同被引文献7

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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