On the computational complexity of (maximum) class scheduling
- 5 September 1991
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 54 (1), 23-38
- https://doi.org/10.1016/0377-2217(91)90320-u
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- An Optimal Solution for the Channel-Assignment ProblemIEEE Transactions on Computers, 1979
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- Minimal Resources for Fixed and Variable Job SchedulesOperations Research, 1978
- Minimizing the number of tankers to meet a fixed scheduleNaval Research Logistics Quarterly, 1954