An approximation algorithm for the license and shift class design problem

DOI10.1016/0377-2217(94)90150-3zbMath0806.90065OpenAlexW2020157242MaRDI QIDQ1328603

Klaus Jansen

Publication date: 19 February 1995

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90150-3

zbMATH Keywords

approximation algorithmdesign planninglicense and shift class design problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Scheduling jobs within time windows on identical parallel machines: New model and algorithms ⋮ A greedy heuristic for shift minimization personnel task scheduling problem

Cites Work

• Unnamed Item
• On the computational complexity of (maximum) class scheduling
• Processor optimization for flow graphs
• An Optimal Solution for the Channel-Assignment Problem
• A Greedy Heuristic for the Set-Covering Problem
• Efficient algorithms for interval graphs and circular-arc graphs
• Games of Boldness, Where the Player Performing the Hardest Task Wins
• Minimal Resources for Fixed and Variable Job Schedules

This page was built for publication: An approximation algorithm for the license and shift class design problem