Dedicated hardware for scheduling problems using genetic algorithm

  • Authors:
  • Masaya Yoshikawa;Hidekazu Terai

  • Affiliations:
  • Department of VLSI System Design, Ritsumeikan University, Kusatsu, Shiga, Japan;Department of VLSI System Design, Ritsumeikan University, Kusatsu, Shiga, Japan

  • Venue:
  • AEE'06 Proceedings of the 5th WSEAS international conference on Applications of electrical engineering
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

NSP (Nurse Scheduling Problem) as a scheduling task consists of assignment of shifts and holidays to nurses for each day on the time horizon, taking into consideration a variety of conflicting interests or objectives between the hospitals and individual nurses. Many works have done for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. However, the problem of the processing time stemming from a population-based search exists in GA. In this paper, we propose a new architecture for high-speed nurse scheduling using GA. The proposed architecture is flexible for many genetic operations on GA. Moreover, the proposed architecture realized not only the pipeline on evaluation phase, but also the pipeline on evolutionary phase on GA. Simulation results evaluating the proposed architecture are shown to the effectiveness comparison with software processing.