Cutting Optimal Pieces from Production Items
| dc.contributor.author | Kirchhof, Michael | |
| dc.contributor.author | Meyer, Oliver | |
| dc.contributor.author | Weihs, Claus | |
| dc.date.accessioned | 2019-03-22T08:14:57Z | |
| dc.date.available | 2019-03-22T08:14:57Z | |
| dc.date.issued | 2019-03-08 | |
| dc.description.abstract | In the process of manufacturing various products, a larger production item is first produced and subsequently smaller parts are cut out of it. In this report we present three algorithms that find optimal positions of production pieces to be cut out of a larger production item. The algorithms are able to consider multiple quality parameters and optimize them in a given priority order. They guarantee different levels of optimality and therefore differ in their required computing time and memory usage. We assemble these algorithms with respect to each’s specific benefits and drawbacks and in adaption to the given computational resources. If possible, the process is sped up by splitting the search for pieces on the whole production item into several local searches. Lastly, the approach is embedded into an application with a graphical user interface to enable its use in the industry. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/37950 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-19935 | |
| dc.language.iso | en | de |
| dc.relation.ispartofseries | Technical Report;1/2019 | |
| dc.subject | battery production | en |
| dc.subject | knapsack algorithm | en |
| dc.subject | optimization | en |
| dc.subject | software development | en |
| dc.subject.ddc | 310 | |
| dc.subject.rswk | Rucksackproblem | de |
| dc.subject.rswk | Optimierung | de |
| dc.subject.rswk | Softwareentwicklung | de |
| dc.subject.rswk | Batterie | de |
| dc.title | Cutting Optimal Pieces from Production Items | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | de |
| dcterms.accessRights | open access | |
| eldorado.secondarypublication | false | de |