期刊文献+

基于启发式调度规则的能力需求计划算法 被引量:2

CRP Algorithm Based on Heuristic Scheduling Rules
原文传递
导出
摘要 传统的能力需求计划方法不能准确地反映实际生产能力需求与负荷。为此设计了基于启发式调度规则的能力需求计划算法,该算法将基于启发式规则的调度算法作用于物料需求计划进行能力需求计算,并对设备负荷率、关键设备资源和关键任务等关键能力信息的计算方法进行了重新定义,以更加真实地反映计划期内计划的能力需求与设备负荷状态。该算法已应用于调度系统中并取得了良好的效果。 Traditional CRP(Capacity Requirements Planning)algorithm can't compute capacity requirements and load precisely.So the CRP algorithm based on Heuristic Scheduling Rules is designed in this paper.In the algorithm,the scheduling algorithm based on Heuristic Rules is used to act on material requirement planning to calculate capacity requirements,and the computational method of machine Load Ratio,Key machine resource and Key Job are redefined to reflect the capacity requirements and load in planning horizon more precisely.The CRP algorithm has been applied in a scheduling system and achieved good results.
出处 《工业工程与管理》 北大核心 2011年第4期124-128,共5页 Industrial Engineering and Management
基金 国家自然科学基金资助项目(70772086) 国家科技支撑计划资助项目(2006BAF01A01) 博士点新教师基金资助项目(200801411063)
关键词 能力需求计划 启发式调度规则 设备负荷率 capacity requirements planning heuristic scheduling rules machine load ratio
  • 相关文献

参考文献17

  • 1张根宝,王时龙,徐宗俊.先进制造技术[M].重庆:重庆大学出版社,1996. 被引量:3
  • 2庄亚明,何建敏.MRPⅡ/ERP能力计划的一种改进方法[J].中国管理科学,2002,10(5):62-68. 被引量:11
  • 3Clark A R, Clark S J. Rolling-horizon lot-sizing when setup times are sequence-dependent [J]. International Journal of Production Research, 2000,38(10) : 2287-2308. 被引量:1
  • 4Clark A R. Optimization approximations for capacity constrained material requirements planning[J]. International Journal of Production Economics, 2003,84 : 115-131. 被引量:1
  • 5Pinedo M. Scheduling: Theory, Algorithms and System [M]. 4nd ed. New Jersey:Prentice Hall,2002. 被引量:1
  • 6Ramon C,Manel M. Different behaviour of a double branch- and-bound algorithm on FmprmuCmax and FmblockCmax problems[J]. Computers & Operations Research, 2007,34(4) : 938-953. 被引量:1
  • 7Luo Xiaochuan,Chu Feng. A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness[J]. Applied Mathematics and Computation, 2006,183 (1) : 575-588. 被引量:1
  • 8Jirachai B,David S K. Priority rule-based heuristic for multimode resource-constrained project scheduling problems with resource vacations and activity sptitting[J]. European Journal of Operational Research, 2007,178(2) : 374-390. 被引量:1
  • 9Susan A S, Thomas E M. Order acceptance with weighted tardiness[J]. Computers & Operations Research, 2007, 34 (10):3029-3042. 被引量:1
  • 10Glover F. Tabu search: Part I [J]. ORSA Journal on Computing, 1989,1(3) : 190-206. 被引量:1

二级参考文献30

  • 1王常青,操云甫,戴国忠.用双向收敛蚁群算法解作业车间调度问题[J].计算机集成制造系统,2004,10(7):820-824. 被引量:31
  • 2吴怡,刘民,吴澄.JSSP基本约束特点分析及调度算法[J].清华大学学报(自然科学版),2004,44(10):1380-1383. 被引量:5
  • 3田澎,杨自厚,张嗣瀛.同顺序(Flow-shop)排序问题的模拟退火求解[J].信息与控制,1994,23(3):133-139. 被引量:11
  • 4王广宇.客户关系管理(CRM)[M].北京:经济管理出版社,2001. 被引量:3
  • 5Cheng R,Gen M,Tsujimura Y.A tutorial survey of job-shop scheduling problems using genetic algorithms-I:Representation[J].Computers & Industrial Engineering,1996,30(4):983-997. 被引量:1
  • 6Cheng R,Gen M,Tsujimura Y.A tutorial survey of job-shop scheduling problems using genetic algorithms,part II:Hybrid genetic search strategies[J].Computers & Industrial Engineering,1999,36(2):343-364. 被引量:1
  • 7Wang L,Zhang L,Zheng D Z.The ordinal optimisation of genetic control parameters for flow shop scheduling[J].The International Journal of Advanced Manufacturing Technology,2004,23(11-12):812-819. 被引量:1
  • 8Grefenstette J.Optimization of control parameters for genetic algorithms[J].IEEE Trans Sys Man Cybern,1986,16(1):122-128. 被引量:1
  • 9Srinivas M,Pantnaik L M.Adaptive probabilities of crossover and mutation in genetic algorithms[J].IEEE Trans Sys Man Cybern,1994,24(4):656-667. 被引量:1
  • 10Ponnambalam S G,Jawahar N,Kumar B S.Estimation of optimum genetic control parameters for job shop scheduling[J].The International Journal of Advanced Manufacturing Technology,2002,19:224-234. 被引量:1

共引文献46

同被引文献19

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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