Modeling M Warehouse N Manpower- Team Allocation Problem Using Dynamic Programming Approach

摘要

In this research, a dynamic programming-based approach is deployed to model and solve the manpower allocation problem for warehouses. The authors specifically evolve the detailed model for M warehouses and N teams (available for allocation to these warehouses). Profitability is considered as a performance measure for the allocation problem. The warehouses and manpower-team are modelled as stages and states respectively within the dynamic programming problem structure. Owing to the rather abstract nature of such allocation problems possessing Markovian properties and having similarities with stage-gate type of a problem, dynamic programming approach is deployed. The study results in recommending key decisions in workforce allocation for organizations such as retailers operating multiple warehouses.