A genetic algorithm for resident physician scheduling problem
| Autor: | Chen-Hsiung Chan, Lei-Ming Sun, Chi-Way Wang, Cheng-Yan Kao, Ming-Hui Jin, Li Liu, Chung-Jung Fu |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Earliest deadline first scheduling
Rate-monotonic scheduling Schedule Mathematical optimization Job shop scheduling Least slack time scheduling Computer science Physics::Medical Physics Dynamic priority scheduling Flow shop scheduling Round-robin scheduling Deadline-monotonic scheduling Fair-share scheduling Multiprocessor scheduling Scheduling (computing) Fixed-priority pre-emptive scheduling Genetic algorithm scheduling Nurse scheduling problem Two-level scheduling Genetic algorithm Lottery scheduling Computer Science::Operating Systems |
| Zdroj: | GECCO |
| Popis: | This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling problem is characterized as satisfying the fair schedule constraint, the physician specification constraint and the safe schedule constraint simultaneously. To minimize the penalties from violating the constraints, this study adopts the evolutionary approach to propose a genetic algorithm for solving the problems. In addition the well-known genetic operators, this study proposed a new mutation operator called dynamic mutation for solving the resident physician scheduling problem. The experimental results show that the proposed algorithm performs well in searching optimal schedules. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|