An analysis of shift class design problems
- 22 December 1994
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 79 (3) , 417-430
- https://doi.org/10.1016/0377-2217(94)90056-6
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximation Algorithms for Fixed Job Schedule ProblemsOperations Research, 1992
- Fixed Job Scheduling with Two Types of ProcessorsOperations Research, 1992
- When Is the Classroom Assignment Problem Hard?Operations Research, 1992
- On the computational complexity of (maximum) class schedulingEuropean Journal of Operational Research, 1991
- The Fixed Job Schedule Problem with Working-Time ConstraintsOperations Research, 1989
- The Fixed Job Schedule Problem with Spread-Time ConstraintsOperations Research, 1987
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- An Optimal Solution for the Channel-Assignment ProblemIEEE Transactions on Computers, 1979
- Minimal Resources for Fixed and Variable Job SchedulesOperations Research, 1978
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950