1. Revenue maximization in an optical router node - allocation of service windows
2. O.J. Boxma (1985). A probabilistic analysis of the LPT scheduling rule. E. Gelenbe editor Performance'84 475--490. O.J. Boxma (1985). A probabilistic analysis of the LPT scheduling rule. E. Gelenbe editor Performance'84 475--490.
3. E.G. Coffman M.R. Garey and D.S. Johnson (1997). Approximation algorithms for bin-packing -- a survey. D.S. Hochbaum editor Approximation Algorithms for NP-hard Problems 46--93. E.G. Coffman M.R. Garey and D.S. Johnson (1997). Approximation algorithms for bin-packing -- a survey. D.S. Hochbaum editor Approximation Algorithms for NP-hard Problems 46--93.
4. M.R. Garey and D.S. Johnson (1990). Computers and Intractability; A Guide to the Theory of NP-Completeness (W. H. Freeman & Co. New York). M.R. Garey and D.S. Johnson (1990). Computers and Intractability; A Guide to the Theory of NP-Completeness (W. H. Freeman & Co. New York).
5. T. Ibaraki and N. Katoh (1988). Resource Allocation Problems (MIT Press Cambridge). T. Ibaraki and N. Katoh (1988). Resource Allocation Problems (MIT Press Cambridge).