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 ob...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2004
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2627 https://www.jstor.org/stable/4101889 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | 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. |
|---|