Manpower Allocation with Time Windows
In this paper, we propose a manpower allocation model with time windows which is of practical interest. This model originates from a real-life port manpower allocation problem where demand is generated from locations in the yard for servicemen who are dispatched from a central point and where the objectives are to minimize the number of servicemen used, travel distances, travel times and waiting times. We develop a tabu-embedded simulated annealing algorithm and a squeaky wheel optimization with local search algorithm for the problem. Experimental results are reported which show the effectiveness of our approaches.
Heuristic, Manpower allocation, port yards
Operations and Supply Chain Management
Journal of the Operational Research Society
LIM, Andrew; RODRIGUES, Brian; and SONG, Lei.
Manpower Allocation with Time Windows. (2004). Journal of the Operational Research Society. 55, (11), 1178-1186. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2627