2003
DOI: 10.1007/s10107-003-0426-2
|View full text |Cite
|
Sign up to set email alerts
|

A subproblem-centric model and approach to the nurse scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
41
0
2

Year Published

2009
2009
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 64 publications
(43 citation statements)
references
References 23 publications
0
41
0
2
Order By: Relevance
“…Minimum staffing requirements of the real-life set-We highlight the practical relevance of employee substitutability by extending our test set with a number of instances that consider real-life demand profiles. These profiles are based on the data set of Ikegami and Niwa (2003), which is also available as a personnel rostering benchmark problem 1 (Brucker et al 2010). The authors investigate the nurse shift scheduling problem in Japan and provide lower and upper bounds on the staffing requirements for two teams of nurses with different skills.…”
Section: Constraint Parameter Settingsmentioning
confidence: 99%
“…Minimum staffing requirements of the real-life set-We highlight the practical relevance of employee substitutability by extending our test set with a number of instances that consider real-life demand profiles. These profiles are based on the data set of Ikegami and Niwa (2003), which is also available as a personnel rostering benchmark problem 1 (Brucker et al 2010). The authors investigate the nurse shift scheduling problem in Japan and provide lower and upper bounds on the staffing requirements for two teams of nurses with different skills.…”
Section: Constraint Parameter Settingsmentioning
confidence: 99%
“…Lapierre (2001), Ferland vd. (2001), Ikegami (2003) ise hastane ihtiyaçlarını ön plana çıkaran modeller oluşturmuşlardır. Özellikle, Azaiez ve Sharif (2005) yaptıkları modelde, ilk kez hem hastane hem de hemşire isteklerini bir anket sonucu belirlemiş ve bu istekleri sadece amaç fonksiyonuna yansıtarak bir matematiksel model oluşturmuşlardır.…”
Section: Li̇teratür Taramasiunclassified
“…One way to deal with this huge solution search space is to divide and conquer, i.e. decompose the problem into sub-problems and treat each part separately and then combine these parts in the final stage [37,43,44]. In this work, the initial solutions for the UKMMC instances are generated by decomposing the problem into sub-problems [29] [34].…”
Section: Build the Harmony Memory (Hm)mentioning
confidence: 99%
“…Table 13, on the other hand, shows a comparison between the HSA with other existing metaheuristic algorithms from the literature on these benchmark instances. In the literature, some mathematical approaches and other exact methods have also been investigated for these instances [53,44]. We compare our proposed HSA with only meta-heuristics from the literature.…”
Section: Hsa For the Benchmark Nrps Datasetmentioning
confidence: 99%