A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem

DOI10.1007/978-3-662-48350-3_6zbMath1401.68023OpenAlexW2130449039MaRDI QIDQ3452768

Davaatseren Baatar, Mohan Krishnamoorthy, Andreas T. Ernst

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_6

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem ⋮ A successful three-phase metaheuristic for the shift minimization personal task scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tactical fixed job scheduling with spread-time constraints
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Interval scheduling on related machines
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
• A metaheuristic for the fixed job scheduling problem under spread time constraints
• Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
• Working time constraints in operational fixed job scheduling
• Interval scheduling: A survey
• The Fixed Job Schedule Problem with Working-Time Constraints
• Efficient algorithms for interval graphs and circular-arc graphs
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• A Primer in Column Generation

This page was built for publication: A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem