Skip to main content

Optimierung von Verschnitt- und Schnittplanfolge in einem Unternehmen der Metallverarbeitenden Industrie

  • Conference paper
DGOR

Part of the book series: Operations Research Proceedings 1981 ((ORP,volume 1981))

  • 146 Accesses

Summary

A company of the metal-working industry has to cut rectangular metal sheets into smaller pieces of given size. The aim consists in minimizing waste and generating a favourable schedule of the cutting patterns. The problem is solved within two steps. First a standard software package for planning waste is used. Then a special heuristic for the solution of the sequencing problem is presented. This implemented heuristic is now part of the standard software package.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Literaturhinweise

  • Götz, H.; Littger, K.; zur Steege, R.: TRIM - ein Verfahren zur Behandlung des zwei- dimensionalen Yerschnittproblems und sein Einsatz bei der Flachqlas AG DELOG-DETA6, IBM-Form K 12 - 1044, BS:G, SC: 69, 1972

    Google Scholar 

  • Golden, B.; Bodin, L.; Doyll, T.; Stewart, W. Jr.: Approximate Traveling Salesman Algorithms, Operations Research 28 (1980), S. 694-711

    Article  Google Scholar 

  • Hartmann, H.: TRENN Programmsystem zur Teilungsoptimierung in Schriftreihe data praxis, Siemens AG (Hrsg.), Best.-Nr. 0 14/4710.

    Google Scholar 

  • Krupp, Friedrich, GmbH (Hrsg.): KRUPP ASC0 Automatische Schnittplanoptimierung recht- eckiger Teile

    Google Scholar 

  • Lenstra, J.K.; Rinnooy Kan, A.: Some Simple Applications of the Traveling Salesman Problem, Operations Research Quaterly 26 (1975), S. 727-733

    Google Scholar 

  • Lin, S.; Kernighan, B.W.: An Effective Heuristic for the Traveling Salesman Problem, Operations Research 21 (1973), S. 498-516

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laubenstein, T., Schneeweiß, C., Vaterrodt, HJ. (1982). Optimierung von Verschnitt- und Schnittplanfolge in einem Unternehmen der Metallverarbeitenden Industrie. In: Fleischmann, B., Bloech, J., Fandel, G., Seifert, O., Weber, H. (eds) DGOR. Operations Research Proceedings 1981, vol 1981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68619-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-68619-1_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11630-1

  • Online ISBN: 978-3-642-68619-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics