On the complexity of manpower shift scheduling
type: Item
instance of: scholarly article
title: On the complexity of manpower shift scheduling
zbMATH Open document ID: 0838.90065
DOI: 10.1016/0305-0548(94)00094-O
author: Hoong Chuin Lau
published in: Computers \& Operations Research
publication date: 1996-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 838680
zbMATH Keywords: shift assignment
zbMATH Keywords: manpower scheduling
MaRDI profile type: Publication
cites work: On Manpower Scheduling Algorithms
cites work: Workforce Scheduling with Cyclic Demands and Day-Off Constraints
cites work: A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
cites work: A multi-level bottleneck assignment approach to the bus drivers' rostering problem
cites work: A heuristic approach to the bus driver scheduling problem
cites work: Multiple Shift Workforce Lower Bounds
cites work: Q4877300
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4198056
cites work: Q4525756
full work available at URL: 0305-0548(94)00094-o
OpenAlex ID: W4243899040
description: scientific article; zbMATH DE number 838680