Name
Abstract | ||
|---|---|---|
This study addresses the issue of scheduling medical treatments for resident patients in a hospital. Schedules are made daily according to the restrictions on medical equipment and physicians who are being assigned at the same time. The problem is formulated as a multi-objective binary integer programming (BIP) model. Three types of metaheuristics are proposed and implemented to deal with the discrete search space, numerous variables, constraints and multiple objectives: a variable neighborhood search (VNS)-based method, scatter search (SS)-based methods and a non-dominated sorting genetic algorithm (NSGA-II). This paper also provides the results of computational experiments and compares their ability to find efficient solutions to the multi-objective scheduling problem. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s10951-012-0278-9 | J. Scheduling |
Keywords | Field | DocType |
Scheduling,Hospitals,Multi-objective metaheuristics | Mathematical optimization,Job shop scheduling,Fair-share scheduling,Variable neighborhood search,Computer science,Real-time computing,Nurse scheduling problem,Resource allocation,Rate-monotonic scheduling,Dynamic priority scheduling,Metaheuristic | Journal |
Volume | Issue | ISSN |
15 | 5 | 1094-6136 |
Citations | PageRank | References |
5 | 0.47 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Silvija Vlah Jerić | 1 | 5 | 0.47 |
| José Rui Figueira | 2 | 852 | 59.84 |