Exact and approximation algorithms for the operational fixed interval scheduling problem
- 6 April 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 82 (1), 190-205
- https://doi.org/10.1016/0377-2217(93)e0335-u
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- License class design: complexity and algorithmsEuropean Journal of Operational Research, 1992
- A DSS for capacity planning of aircraft maintenance personnelInternational Journal of Production Economics, 1991
- On the computational complexity of (maximum) class schedulingEuropean Journal of Operational Research, 1991
- The Fixed Job Schedule Problem with Spread-Time ConstraintsOperations Research, 1987
- Scheduling jobs with fixed start and end timesDiscrete Applied Mathematics, 1987
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Minimal Resources for Fixed and Variable Job SchedulesOperations Research, 1978
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- On the facial structure of set packing polyhedraMathematical Programming, 1973
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950