Manpower Scheduling with Time Windows
Conference Proceeding Article
In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates from peculiar port yard scheduling needs 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 scheduled, travel distances, travel times and waiting times at each location. Although closely related to the well-known vehicle routing problem, this problem is different while its solution could provide insight to the latter. We develop solutions using metaheuristic methods, and in particular provide tabu embedded simulated annealing and squeaky wheel optimization with local search algorithms for this problem. We apply these newly-developed metaheuristics with adaptations for solutions to the manpower allocation problem, while our analysis throws light on how these work. Computational results are reported which show the effectiveness of our approach when applied to the manpower allocation problem.
Operations and Supply Chain Management
SAC '03: Proceedings of the 2003 ACM Symposium on Applied Computing, Melbourne, Florida, March 9-12 2003
City or Country
Melbourne, FL, USA
LIM, Andrew; RODRIGUES, Brian; and SONG, Lei.
Manpower Scheduling with Time Windows. (2003). SAC '03: Proceedings of the 2003 ACM Symposium on Applied Computing, Melbourne, Florida, March 9-12 2003. 741-746. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2071