RHoBNhbIcRRlRj54ugTWm4OM67af4cAYmlWR0SZB3zgwNg5TDFVzkQM1SwSl
Current position: Home >> Scientific Research >> Paper Publications

A new capacity requirements planning algorithm based on Heuristic scheduling

Release Time:2019-03-11  Hits:

Indexed by: Journal Article

Date of Publication: 2011-06-17

Journal: Lecture Notes in Electrical Engineering

Included Journals: Scopus、EI

Volume: 126 LNEE

Issue: VOL. 3

Page Number: 373-381

ISSN: 9783642257650

Abstract: 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.

Prev One:基于启发式调度规则的能力需求计划算法

Next One:钢铁企业在制品成本追溯模型研究