Algorithms for large scale shift minimisation personnel task scheduling problems
From MaRDI portal
Publication:439608
DOI10.1016/j.ejor.2011.11.034zbMath1244.90094OpenAlexW1998645747MaRDI QIDQ439608
Davaatseren Baatar, Andreas T. Ernst, Mohan Krishnamoorthy
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.034
Related Items (20)
Task assignment with start time-dependent processing times for personnel at check-in counters ⋮ A study of decision support models for online patient-to-room assignment planning ⋮ A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem ⋮ Workforce planning incorporating skills: state of the art ⋮ A constraint-based approach for the shift design personnel task scheduling problem with equity ⋮ Minimizing average project team size given multi-skilled workers with heterogeneous skill levels ⋮ Solving technician routing and scheduling problem using improved particle swarm optimization ⋮ Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem ⋮ A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem ⋮ A new formulation and an effective matheuristic for the airport gate assignment problem ⋮ A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements ⋮ Staff and machine shift scheduling in a German potash mine ⋮ Improved quantum genetic algorithm in application of scheduling engineering personnel ⋮ Multi-objective dynamic fuzzy scheduling and its algorithm in product collaborative design considering emergency ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ An exact approach for the personnel task rescheduling problem with task retiming ⋮ A greedy heuristic for shift minimization personnel task scheduling problem ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ A successful three-phase metaheuristic for the shift minimization personal task scheduling problem ⋮ Solving the general employee scheduling problem
Cites Work
- Unnamed Item
- Scheduling jobs with fixed start and end times
- A graph colouring model for assigning a heterogeneous workforce to a given schedule
- Staff rostering at a large international airport
- Staff scheduling and rostering: a review of applications, methods and models.
- The volume algorithm: Producing primal solutions with a subgradient method
- An annotated bibliography of personnel scheduling and rostering
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Dioïds and semirings: Links to fuzzy sets and other applications
- A Generalized Wedelin Heuristic for Integer Programming
- Interval scheduling: A survey
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- An Optimal Solution for the Channel-Assignment Problem
- Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines
- Approximation Algorithms for Fixed Job Schedule Problems
- Minimal Resources for Fixed and Variable Job Schedules
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
This page was built for publication: Algorithms for large scale shift minimisation personnel task scheduling problems
