Dynamic Programming Solution for the Optimal Allocation of Mine Manpower to Multiple Work Activities

Abstract

A dynamic programming model is formulated and applied to allocate coal miners among work activities optimally on an operating shift basis. The recurrence relation used maximizes the revenues obtained by allocating miners to separate but competing work activities. © 1989 Elsevier Science Publishers B.V.

Department(s)

Mining Engineering

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 1989 Elsevier, All rights reserved.

Publication Date

01 Jan 1989

Share

 
COinS