BibTeX
@MISC{Kim_schedulingproblem,
author = {Sun-jeong Kim and Young-woong Ko and Saangyong Uhmn and Jin Kim},
title = {Scheduling Problem},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We applied genetic algorithm to nurse scheduling problem. For time complexity problem of genetic algorithm, we suggested efficient operators using a cost bit matrix of which each cell indicates any violation of constraints. A cell with 1 indicates that the corresponding assignment violates constraints and needs no further consideration. The experimental results showed that the suggested method generated a nurse scheduling faster in time and better in quality compared to the traditional genetic algorithm.
