DMCA
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence A Tree-Based Tabu Search Algorithm for the Manpower Allocation Problem with Time Windows and Job-Teaming Constraints
Cached
Download Links
BibTeX
@MISC{Cai_proceedingsof,
author = {Yilin Cai and Zizhen Zhang and Songshan Guo and Hu Qin and Andrew Lim},
title = {Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence A Tree-Based Tabu Search Algorithm for the Manpower Allocation Problem with Time Windows and Job-Teaming Constraints},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper investigates the manpower allocation problem with time windows and job-teaming constraints (MAPTWTC), a practical scheduling and routing problem that tries to synchronize workers’ schedules to complete all tasks. We first provide an integer programming model for the problem and discuss its properties. Next, we show that tree data structure can be used to represent the MAPTWTC solutions, and its optimal solution can be obtained from one of trees by solving a minimum cost flow model for each worker type. Consequently, we develop for the problem a novel tabu search algorithm employing search operators based on the tree data structure. Finally, we prove the effectiveness of the tabu search algorithm by computational experiments on two sets of instances. 1
Keyphrases
job-teaming constraint time window twenty-third international joint conference manpower allocation problem tree data structure computational experiment routing problem novel tabu search optimal solution minimum cost flow model practical scheduling maptwtc solution allocation problem search operator worker type tabu search algorithm worker schedule
