Advertisement

Production Planning in a Small Firm in the Glass Industry

  • Oli B. G. Madsen
Part of the NATO Conference Series book series (NATOCS, volume 14)

Abstract

Focusing on a small firm and its special problems a case from the glass industry is presented. The paper describes a computerized glass cutting procedure and a sequencing procedure for ordering the cutting patterns in an optimal way. It is also discussed how model sophistication, computer capacity and the need of simple administrative routines may cause conflicts, particularly in small firms.

Keywords

Small Firm Production Planning Travel Salesman Problem Glass Industry Stage Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Christensen, B.G., 1975, Planning of glass cutting (in Danish), report from IMSOR, The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, Lyngby, Denmark.Google Scholar
  2. Gilmore, P.C. and Gomory, R.E., 1965, Multistage cutting-stock problems of two and more dimensions, Operations Res., 13:94.CrossRefGoogle Scholar
  3. Gilmore, P.C. and Gomory, R.E., 1966, The theory and computation of knapsack functions, Operations Res., 14:1045.CrossRefGoogle Scholar
  4. Kæergard, K.E., 1981, Minimizing the order spread in thermopane production (in Danish), report from IMSOR, The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, Lyngby, Denmark.Google Scholar
  5. Lin, S., 1965, Computer solutions to the travelling-salesman problem, Bell System Techn. J., XLIV:2245.Google Scholar
  6. Madsen, O.B.G., 1979, Glass cutting in a small firm, Math. Progr., 17:85.CrossRefGoogle Scholar
  7. Madsen, O.B.G., 1980, A cutting sequencing algorithm, p. 388 in: “Optimization Techniques”, K. Iracki, M. Malanowski and S. Walukiewicz, eds., Springer Verlag, Hamburg, West Germany.CrossRefGoogle Scholar
  8. Madsen, O.B.G. and Kærgard, K.E. 1981a, Some methods solving the pattern allocation problem, RR 19, IMSOR, The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, Lyngby, Denmark.Google Scholar
  9. Madsen, O.B.G. and Kærgård, K.E., 1981b, The application of travelling salesman routines to solve pattern allocation problems II, RR 24, IMSOR, The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, Lyngby, Denmark.Google Scholar

Copyright information

© Plenum Press, New York 1983

Authors and Affiliations

  • Oli B. G. Madsen
    • 1
  1. 1.IMSOR, The Institute of Mathematical Statistics and Operations ResearchThe Technical University of DenmarkLyngbyDenmark

Personalised recommendations