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: | , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2004
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/2627 https://www.jstor.org/stable/4101889 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |
| 總結: | 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. |
|---|