DMCA
Combination of Local Search Strategies for Rotating Workforce Scheduling Problem
BibTeX
@MISC{Musliu_combinationof,
author = {Nysret Musliu},
title = {Combination of Local Search Strategies for Rotating Workforce Scheduling Problem},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Rotating workforce scheduling is a typical constraint satisfaction problem which appears in a broad range of work places (e.g. industrial plants). Solving this problem is of a high practical relevance. In this paper we propose the combination of tabu search with random walk and min conflicts strategy to solve this problem. Computational results for benchmark examples in literature and other real life examples show that combination of tabu search with random walk and min conflicts strategy improves the performance of tabu search for this problem. The methods proposed in this paper improve performance of the state of art commercial system for generation of rotating workforce schedules.
Keyphrases
tabu search rotating workforce scheduling problem local search strategy min conflict strategy random walk broad range typical constraint satisfaction problem work place computational result real life example high practical relevance workforce schedule benchmark example industrial plant workforce scheduling art commercial system
