A triplet-based exact method for the shift minimisation personnel task scheduling problem

DOI10.1007/978-3-662-48350-3_6MaRDI QIDQ3452768zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Algorithms for large scale shift minimisation personnel task scheduling problems
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
• A greedy heuristic for shift minimization personnel task scheduling problem
• The personnel task scheduling problem
• A successful three-phase metaheuristic for the shift minimization personal task scheduling problem

Cites work

• A metaheuristic for the fixed job scheduling problem under spread time constraints
• A Primer in Column Generation
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Efficient algorithms for interval graphs and circular-arc graphs
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3185974 (Why is no real title available?)
• Interval scheduling on related machines
• Interval scheduling: A survey
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
• Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
• Tactical fixed job scheduling with spread-time constraints
• The Fixed Job Schedule Problem with Working-Time Constraints
• The personnel task scheduling problem
• Working time constraints in operational fixed job scheduling

Cited in

(10)

• A greedy heuristic for shift minimization personnel task scheduling problem
• A successful three-phase metaheuristic for the shift minimization personal task scheduling problem
• An exact approach for the personnel task rescheduling problem with task retiming
• 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
• The personnel task scheduling problem
• A constraint-based approach for the shift design personnel task scheduling problem with equity
• Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Alternative MIP formulations for an integrated shift scheduling and task assignment problem

This page was built for publication: A triplet-based exact method for the shift minimisation personnel task scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452768)