A greedy heuristic for shift minimization personnel task scheduling problem

DOI10.1016/j.cor.2018.07.010zbMath1458.90306OpenAlexW2883056677MaRDI QIDQ1782156

Mehran Hojati

Publication date: 18 September 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.010

zbMATH Keywords

greedy heuristicfixed interval schedulingfixed task schedulingpersonnel task scheduling

Mathematics Subject Classification ID

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

Related Items (3)

A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements ⋮ An exact approach for the personnel task rescheduling problem with task retiming ⋮ A successful three-phase metaheuristic for the shift minimization personal task scheduling problem

Cites Work

• Algorithms for large scale shift minimisation personnel task scheduling problems
• An integer linear programming-based heuristic for scheduling heterogeneous, part-time service employees
• An approximation algorithm for the license and shift class design problem
• Staff rostering at a large international airport
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
• Interval scheduling: A survey
• Games of Boldness, Where the Player Performing the Hardest Task Wins
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem

This page was built for publication: A greedy heuristic for shift minimization personnel task scheduling problem