Manpower Allocation with Time Windows

Publication Type

Journal Article

Publication Date

11-2004

Abstract

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.

Keywords

Heuristic, Manpower allocation, port yards

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Journal of the Operational Research Society

Volume

55

Issue

11

First Page

1178

Last Page

1186

ISSN

0160-5682

Identifier

10.1057/palgrave.jors.2601782

Publisher

Palgrave

Additional URL

https://doi.org/10.1057/palgrave.jors.2601782

Link to Full Text

Share

COinS