scientific article; zbMATH DE number 1215040

MaRDI QIDQ4216477zbMATH OpenFDO

Authors R. N. Bailey, K. M. Garner, M. F. Hobbs

Publication date 26 October 1998

zbMATH Keywords

genetic algorithmsheuristic searchscheduling staffsimulated annealing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A simulated annealing approach to the cyclic staff-scheduling problem
• Genetic algorithms used to solve scheduling problems
• A simulated-annealing heuristic for shift scheduling using non-continuously available employees
• Optimizing simulated annealing schedules with genetic programming

Cited in

(13)

• Stochastic programming for nurse assignment
• Optimizing simulated annealing schedules with genetic programming
• Staff scheduling and rostering: a review of applications, methods and models.
• The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
• A simulated annealing methodology to distribution network design and management
• A simulated annealing approach to the solution of job rotation scheduling problems
• Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering
• Constraint satisfaction methods for solving the staff transfer problem
• scientific article; zbMATH DE number 1159196 (Why is no real title available?)
• A simulated annealing approach to the cyclic staff-scheduling problem
• A comparison of three heuristics on a practical case of sub-daily staff scheduling
• A Simulated Annealing Genetic Algorithm for Solving Timetable Problems
• A hybrid metaheuristic case-based reasoning system for nurse rostering

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 Q4216477)