Combination of Local Search Strategies for Rotating Workforce Scheduling Problem
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1529-1529.
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.
@inproceedings{ijcai2005p327,
title = {Combination of Local Search Strategies for Rotating Workforce Scheduling Problem},
author = {Musliu, Nysret},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1529--1529},
year = {2005},
url = {https://ijcai.org/proceedings/2005/327},
}
TY - CPAPER TI - Combination of Local Search Strategies for Rotating Workforce Scheduling Problem AU - Musliu, Nysret T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1529 EP - 1529 UR - https://ijcai.org/proceedings/2005/327 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
