1993
DOI: 10.1016/0305-0548(93)90105-r
|View full text |Cite
|
Sign up to set email alerts
|

A heuristic-based computerized nurse scheduling system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

1997
1997
2016
2016

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 38 publications
(15 citation statements)
references
References 5 publications
0
15
0
Order By: Relevance
“…(7) states that each operator should work continuously for at most six days. Equation (8) states that the number of overtime days for each operator shall not exceed the number of overtime days specified by company policy. Note that A represents the number of overtime days during the scheduling cycle.…”
Section: (7)mentioning
confidence: 99%
See 1 more Smart Citation
“…(7) states that each operator should work continuously for at most six days. Equation (8) states that the number of overtime days for each operator shall not exceed the number of overtime days specified by company policy. Note that A represents the number of overtime days during the scheduling cycle.…”
Section: (7)mentioning
confidence: 99%
“…(3) Heuristic scheduling: Randhawa and Sitompul [8] proposed a heuristic-based decision support system for nurse scheduling based on a weekly cycle and the assumption that the work shift of each nurse remained unchanged over the course of the week. However, the scheduling model took no account of which work shift should be assigned to which particular nurse since this was thought to be best decided by hospital staff themselves.…”
Section: B Operator Schedulingmentioning
confidence: 99%
“…However, his work demonstrates the utility of hybrid GAs in solving scheduling problems and hints that the best use of hybrid GAs may be in less-structured problems. Randhawa and Sitompul [1993] developed a heuristic-based decision support system that solves a nurse-scheduling problem similar to the assignment of proctors. The system first generates legal patterns for the nurse shifts: (1) days of the week to be worked and (2) sequences of shifts (day, evening, night).…”
Section: Related Workmentioning
confidence: 99%
“…Miller et al (1976) were the first to formally address the preference scheduling problem. Starting with an initial solution, they developed a greedy neighborhood search procedure to find local optima (Randhawa and Sitompul, 1993). More recently, metaheuristics, such as tabu search, have been designed for various nurse rostering problems.…”
Section: Introductionmentioning
confidence: 99%