scientific article; zbMATH DE number 1175393

MaRDI QIDQ4398248zbMATH OpenFDO

Authors Andrzej Jaszkiewicz

Publication date 10 December 1998

zbMATH Keywords

decision support systemmetaheuristicmultiple objective combinatorial optimizationnurse schedulingPareto simulated annealing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Management decision making, including multiple objectives (90B50) Integer programming (90C10) Multi-objective and goal programming (90C29)

Recommendations

• A Pareto-based search methodology for multi-objective nurse scheduling
• Solving the multi-objective nurse scheduling problem with a weighted cost function
• Constructing nurse schedules at large hospitals
• Finding good nurse duty schedules: a case study
• Scheduling the flying squad nurses of a hospital using a multi-objective programming model

Cited in

(17)

• A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
• Scheduling the flying squad nurses of a hospital using a multi-objective programming model
• A Pareto-based search methodology for multi-objective nurse scheduling
• Solving multiple criteria choice problems by interactive trichotomy segmentation
• Generalized assignment type goal programming problem: application to nurse scheduling
• A shift sequence based approach for nurse scheduling and a new benchmark dataset
• An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
• Solving the multi-objective nurse scheduling problem with a weighted cost function
• An estimation of distribution algorithm for nurse scheduling
• A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
• The influence of the fitness evaluation method on the performance of multiobjective search algorithms
• Multiobjective optimization in health care management: a metaheuristic and simulation approach
• Constructing nurse schedules at large hospitals
• A heuristic algorithm based on multi-assignment procedures for nurse scheduling
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• A grasp-knapsack hybrid for a nurse-scheduling problem
• Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398248)