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

Mohit Goswami
Additional contact information
Mohit Goswami: Indian Institute of Management, Raipur, India

International Journal of Strategic Decision Sciences (IJSDS), 2019, vol. 10, issue 4, 100-112

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

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJSDS.2019100106 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jsds00:v:10:y:2019:i:4:p:100-112

Access Statistics for this article

International Journal of Strategic Decision Sciences (IJSDS) is currently edited by Saeed Tabar

More articles in International Journal of Strategic Decision Sciences (IJSDS) from IGI Global
Bibliographic data for series maintained by Journal Editor ().