Finding good nurse duty schedules: a case study (Q954255): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q295266
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-007-0035-7 / rank
Normal rank
 
Property / author
 
Property / author: Jan H. van Vuuren / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PARPAP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hyperheuristics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-007-0035-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033987443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An indirect genetic algorithm for a nurse-scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building better nurse scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 0-1 goal programming model for nurse scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preference scheduling for nurses using column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic preference scheduling of nurses using a Lagrangian-based heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy-based neighborhood search approach to a nurse rostering problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state of the art of nurse rostering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nurse rostering problems -- a bibliographic survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a nurse scheduling problem with knapsacks, networks and tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of personnel scheduling and rostering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staff scheduling and rostering: a review of applications, methods and models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the flying squad nurses of a hospital using a multi-objective programming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Packing: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subproblem-centric model and approach to the nurse scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized linear programming model for nurse scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary approach for the nurse rerostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic and non-cyclic scheduling of 12h shift nurses by network programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm approach to a nurse rerostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the multi-objective nurse scheduling problem with a weighted cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic programming for nurse assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450941 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-007-0035-7 / rank
 
Normal rank

Latest revision as of 09:47, 10 December 2024

scientific article
Language Label Description Also known as
English
Finding good nurse duty schedules: a case study
scientific article

    Statements

    Finding good nurse duty schedules: a case study (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2008
    0 references
    heuristic duty scheduling
    0 references
    tabu search
    0 references
    nurse rostering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers