An analysis of shift class design problems

DOI10.1016/0377-2217(94)90056-6zbMath0813.90063OpenAlexW2139214056MaRDI QIDQ1342640

Antoon W. J. Kolen, Leo G. Kroon

Publication date: 30 May 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1765/6680

zbMATH Keywords

worst case behaviouraircraft maintenance processfixed job schedule problempreemptive variant verses the non-preemptive variant

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals ⋮ Routing trains through railway stations: Complexity issues

Cites Work

• Unnamed Item
• Unnamed Item
• On the computational complexity of (maximum) shift class scheduling
• Scheduling jobs with fixed start and end times
• On the computational complexity of (maximum) class scheduling
• License class design: Complexity and algorithms
• A decomposition theorem for partially ordered sets
• The Fixed Job Schedule Problem with Spread-Time Constraints
• The Fixed Job Schedule Problem with Working-Time Constraints
• An Optimal Solution for the Channel-Assignment Problem
• When Is the Classroom Assignment Problem Hard?
• Games of Boldness, Where the Player Performing the Hardest Task Wins
• Approximation Algorithms for Fixed Job Schedule Problems
• Minimal Resources for Fixed and Variable Job Schedules

This page was built for publication: An analysis of shift class design problems