Optimization Problems in a Semi-Automatic Device for Cutting Leather

Alexander Pott and Holger Glaab
Additional contact information
Alexander Pott: Otto-von-Guericke-Universität Magdeburg, Institut für Algebra und Geometrie
Holger Glaab: Institut für Mathematik, Universität Augsburg

A chapter in Mathematics — Key Technology for the Future, 2003, pp 609-622 from Springer

Abstract: Abstract Cutting large leather skins is a two step process, a “decision step” and a “cutting step”. In the decision step, it has to be decided which piece is cut from which part of the skin. This is called nesting. After the nesting process the actual cutting takes place. The cooperation company HUMANTEC GmbH in Wemding (Germany, Bavaria) has developed a machine where the nesting is done by a person and not by a computer. The machine just assists the worker and helps her to find a good nesting. Only the cutting process is basically fully automatic. In both parts, the nesting and the cutting process, mathematical problems related to the travelling salesman problem occur.

Keywords: Travel Salesman Problem; Precedence Constraint; Hamiltonian Path; Cooperation Partner; Integer Linear Programming Problem (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-55753-8_47

Ordering information: This item can be ordered from
http://www.springer.com/9783642557538

DOI: 10.1007/978-3-642-55753-8_47

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().