Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations

DOI10.1016/0377-2217(94)00063-IzbMath0915.90169OpenAlexW2076715315MaRDI QIDQ1390207

Larry W. Jacobs, Michael J. Brusco

Publication date: 14 July 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00063-i

zbMATH Keywords

simulated annealingbranch-and-boundlocal-search heuristicpersonnel-scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Related Items

Near-optimal MIP solutions for preference based self-scheduling ⋮ A grasp-knapsack hybrid for a nurse-scheduling problem ⋮ Workforce scheduling with multiple objectives ⋮ Metaheuristics: A bibliography ⋮ Cyclic preference scheduling of nurses using a Lagrangian-based heuristic ⋮ A shift sequence based approach for nurse scheduling and a new benchmark dataset ⋮ Solution approaches to large shift scheduling problems ⋮ Bridging the gap between self schedules and feasible schedules in staff scheduling ⋮ Implicit shift scheduling with multiple breaks and work stretch duration restrictions ⋮ Starting-time decisions in labor tour scheduling: An experimental analysis and case study ⋮ A sequential integer programming method for discontinuous labor tour scheduling ⋮ Variable employee productivity in workforce scheduling ⋮ HARMONY SEARCH WITH NOVEL SELECTION METHODS IN MEMORY CONSIDERATION FOR NURSE ROSTERING PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Simulated annealing for machine layout problems in the presence of zoning constraints
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Working set generation methods for labor tour scheduling
• Sufficient Working Subsets for the Tour Scheduling Problem
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems
• Solving Large-Scale Tour Scheduling Problems
• A simulated annealing approach to the cyclic staff-scheduling problem
• The Operator-Scheduling Problem: A Network-Flow Approach
• Equation of State Calculations by Fast Computing Machines