CAPACITY PLANNING BY THE DYNAMIC MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM (DMRGAP)

The allocation of available capacity among competing demand and users is a problem encountered in areas such as job shop scheduling, the tru cking industry and distributed computer systems. In all these areas a model known as the Multi-Resource Generalized Assignment Problem (MRGA P) has been proposed as a tool to assign available capacity among the competing applications. In this paper we extend the MRGAP model to the case where demand varies over time and capacity assignments are dynam ic. We show that the extended model can be used for strategic capacity planning and we develop efficient solution procedures to solve the dy namic version of MRGAP. (C) 1998 Elsevier Science B.V.