The Stock Size Problem

References

• Abdel-Wahab H. M., Kameda T. Scheduling to minimize the maximum cumulative cost subject to series-parallel precedence constraints. Opns. Res. (1978) 26:141–158Link, Google Scholar
• Banaszczyk W. The Steinitz constant of the plane. J. Reine Angew. Math. (1987) 373:218–220Google Scholar
• Blaźewicz J., Cellary W., Slowiński R., Węglarz J. Scheduling under resource constraints. Annals of OR (1986) 7(Baltzer, Basel) Google Scholar
• Blaźewicz J., Lenstra J. K., Rinnoy Kan A. H. G. Scheduling subject to resource constraints. Discr. Appl. Math. (1983) 5:11–24Crossref, Google Scholar
• Garey M. R., Johnson D. S.Ausiello and Lucertini. Approximation algorithms for bin packing problems: A survey. Analysis and Design of Algorithms in Combinatorial Optimization (1981) (Springer, New York) Crossref, Google Scholar
• Grinberg V. S., Sevast'janov S. V. On the value of the Steinitz constant. Funkcional'nyj Analiz i ego Prilozhenia (1980) 14:56–57(In Russian)Google Scholar
• Kellerer H., Rendl F., Woeginger G. Computing the optimum stock size. (1991) . Technical Report 202, Technische Universität GrazGoogle Scholar
• Monma C. L. Sequencing to minimize the maximum job cost. Opns. Res. (1980) 28:942–951Link, Google Scholar
• Steinitz E. Bedingt Konvergente Reihen und Konvexe Systeme. J. Reine Angew. Math (1913) 143:128–175Crossref, Google Scholar