License class design: complexity and algorithms

This publication has 7 references indexed in Scilit:

• On the computational complexity of (maximum) class scheduling
  European Journal of Operational Research, 1991
• Scheduling jobs with fixed start and end times
  Discrete Applied Mathematics, 1987
• An Optimal Solution for the Channel-Assignment Problem
  IEEE 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 Schedules
  Operations Research, 1978
• Minimizing the number of tankers to meet a fixed schedule
  Naval Research Logistics Quarterly, 1954
• A Decomposition Theorem for Partially Ordered Sets
  Annals of Mathematics, 1950