点击次数：

发布时间：2019-03-11

论文类型：期刊论文

发表时间：2011-06-17

发表刊物：Lecture Notes in Electrical Engineering

收录刊物：Scopus、EI

卷号：126 LNEE

期号：VOL. 3

页面范围：373-381

ISSN号：9783642257650

摘要：Traditional CRP(Capacity Requirements Planning) algorithm can not compute production capacity requirements precisely. We design a scheduling algorithm based on Heuristic Rules and use it to form a new CRP Algorithm which results in computing production capacity requirements precisely. The new definitions of Machine Load Ratio, Key Machine and Key Job indicate more realistically forecasting operation situation in planning horizon. Arithmetic computing complexity of the scheduling algorithm determines that the new CRP Algorithm is feasible. © Springer-Verlag Berlin Heidelberg 2012.