On the computational complexity of (maximum) class scheduling
From MaRDI portal
Publication:1179005
DOI10.1016/0377-2217(91)90320-UzbMATH Open0741.90035OpenAlexW2097743222MaRDI QIDQ1179005FDOQ1179005
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
Recommendations
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Scheduling jobs with fixed start and end times
- Dioïds and semirings: Links to fuzzy sets and other applications
- When Is the Classroom Assignment Problem Hard?
- An Optimal Solution for the Channel-Assignment Problem
- 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 ]
- Max-min matching problems with multiple assignments
- Title not available (Why is that?)
Cited In (22)
- On the computational complexity of (maximum) shift class scheduling
- Interval scheduling on identical machines
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Working time constraints in operational fixed job scheduling
- A fixed job scheduling problem with machine-dependent job weights
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- Methods to solve multi-skill project scheduling problem
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
- An analysis of shift class design problems
- Increasing the revenue of self-storage warehouses by optimizing order scheduling
- Optimal interval scheduling with a resource constraint
- An approximation algorithm for the license and shift class design problem
- On the complexity of 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
- License class design: Complexity and algorithms
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes
- The optimal cost chromatic partition problem for trees and interval graphs
- On the complexity of adjacent resource scheduling
- Routing trains through railway stations: Complexity issues
This page was built for publication: On the computational complexity of (maximum) class scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179005)
