On the computational complexity of (maximum) class scheduling
From MaRDI portal
Publication:1179005
DOI10.1016/0377-2217(91)90320-UzbMath0741.90035OpenAlexW2097743222MaRDI QIDQ1179005
Leo G. Kroon, Antoon W. J. Kolen
Publication date: 26 June 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90320-u
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (19)
An approximation algorithm for the license and shift class design problem ⋮ Working time constraints in operational fixed job scheduling ⋮ An analysis of shift class design problems ⋮ Increasing the revenue of self-storage warehouses by optimizing order scheduling ⋮ A fixed job scheduling problem with machine-dependent job weights ⋮ Optimal interval scheduling with a resource constraint ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Exact and approximation algorithms for the operational fixed interval scheduling problem ⋮ Methods to solve multi-skill project scheduling problem ⋮ On the computational complexity of (maximum) shift class scheduling ⋮ Matching supply and demand in a sharing economy: classification, computational complexity, and application ⋮ License class design: Complexity and algorithms ⋮ On the complexity of interval scheduling with a resource constraint ⋮ A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem ⋮ Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals ⋮ Routing trains through railway stations: Complexity issues ⋮ Interval scheduling on identical machines ⋮ Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions ⋮ Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling jobs with fixed start and end times
- Max-min matching problems with multiple assignments
- Dioïds and semirings: Links to fuzzy sets and other applications
- 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
- Minimal Resources for Fixed and Variable Job Schedules
- On the complexity of computing the measure of ∪[a i ,b i ]
This page was built for publication: On the computational complexity of (maximum) class scheduling
