A greedy heuristic for shift minimization personnel task scheduling problem
type: Item
instance of: scholarly article
title: A greedy heuristic for shift minimization personnel task scheduling problem
zbMATH Open document ID: 1458.90306
author: Mehran Hojati
published in: Computers \& Operations Research
publication date: 2018-09-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B70
zbMATH DE Number: 6938892
zbMATH Keywords: personnel task scheduling
zbMATH Keywords: greedy heuristic
zbMATH Keywords: fixed task scheduling
zbMATH Keywords: fixed interval scheduling
MaRDI profile type: Publication
full work available at URL: j.cor.2018.07.010
OpenAlex ID: W2883056677
cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins
cites work: Staff rostering at a large international airport
cites work: Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
cites work: An integer linear programming-based heuristic for scheduling heterogeneous, part-time service employees
cites work: An approximation algorithm for the license and shift class design problem
cites work: Interval scheduling: A survey
cites work: Algorithms for large scale shift minimisation personnel task scheduling problems
cites work: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
cites work: Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
DOI: 10.1016/J.COR.2018.07.010
description: scientific article; zbMATH DE number 6938892