An analysis of shift class design problems
type: Item
instance of: scholarly article
title: An analysis of shift class design problems
zbMATH Open document ID: 0813.90063
DOI: 10.1016/0377-2217(94)90056-6
author: Antoon W. J. Kolen
author: Leo Kroon
published in: European Journal of Operational Research
publication date: 1995-05-30T00:00:00Z
full work available at URL: http://hdl.handle.net/1765/6680
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 710943
zbMATH Keywords: fixed job schedule problem
zbMATH Keywords: aircraft maintenance process
zbMATH Keywords: worst case behaviour
zbMATH Keywords: preemptive variant verses the non-preemptive variant
MaRDI profile type: Publication
OpenAlex ID: W2139214056
cites work: Scheduling jobs with fixed start and end times
cites work: When Is the Classroom Assignment Problem Hard?
cites work: A decomposition theorem for partially ordered sets
cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins
cites work: The Fixed Job Schedule Problem with Spread-Time Constraints
cites work: The Fixed Job Schedule Problem with Working-Time Constraints
cites work: Approximation Algorithms for Fixed Job Schedule Problems
cites work: Q4198056
cites work: Minimal Resources for Fixed and Variable Job Schedules
cites work: Q3328583
cites work: An Optimal Solution for the Channel-Assignment Problem
cites work: On the computational complexity of (maximum) class scheduling
cites work: License class design: Complexity and algorithms
cites work: On the computational complexity of (maximum) shift class scheduling
description: scientific article; zbMATH DE number 710943