{"id":5476,"date":"2024-05-17T14:37:37","date_gmt":"2024-05-17T12:37:37","guid":{"rendered":"https:\/\/www.sequoia-iao.de\/?page_id=5476"},"modified":"2025-09-03T12:13:08","modified_gmt":"2025-09-03T10:13:08","slug":"kostenoptimierung-und-auslegung-von-fertigungsstrassen","status":"publish","type":"page","link":"https:\/\/www.kqcbw.de\/en\/kostenoptimierung-und-auslegung-von-fertigungsstrassen\/","title":{"rendered":"Cost Optimization and Design of Production Lines"},"content":{"rendered":"
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Cost Optimization and Design of Production Lines<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t

\n\t\t\t\t\t\tSolving the Assemly Line Balancing Problem\t\t\t\t\t<\/h3>\n\t\t\t\t\n\t\t\t\t\t\t\t\t\t

\n\t\t\t\t\t\tFraunhofer IPA\t\t\t\t\t<\/h5>\n\t\t\t\t\n\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

In the demonstrator, an instance of the Assembly Line Balancing (ALB) problem is formulated and solved. In assembly line balancing, a production line for a specific product is to be set up in such a way that the lowest possible acquisition costs for machines are incurred and a specified cycle time is maintained. The problem is formulated mathematically as a Quadratic Unrestricted Binary Optimization problem (QUBO). It is then solved using simulated annealing and a heuristic search. The results show that the optimal solution of the instance is found with this method.<\/span><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tTo the demonstrator in the Fraunhofer GitLab<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t
<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tTo the interactive Jupyter Notebook<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t

\n\t\t\t\t\t\tOptimal cutting layouts for metal parts manufacturing (BPP)\t\t\t\t\t<\/h3>\n\t\t\t\t\n\t\t\t\t\t\t\t\t\t

\n\t\t\t\t\t\tFraunhofer IPA\t\t\t\t\t<\/h5>\n\t\t\t\t\n\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

The 2D irregular strip packing problem consists in finding the position and orientation of a set of polygons commonly referred to as \"pieces\" into a strip, i.e. a rectangular-shaped container with imposed and fixed height and variable length, such that: all the pieces fit completely inside the container, no two pieces intersect or \u00bboverlap\u00ab and the container's length is minimum. This problem is of significant economic importance as it allows the Manufacturing Industry to minimize its costs for materials such as fabric, leather, carton, wood, plastic, glass, ceramic or metal which are used for producing elementary parts composing finished products, such as cloths, cars, ships, electrical appliances, machines and packaging. The problem is also is great ecological importance, as it allows to reduce the industrial consumption of natural resources and the amount of industrial waste.\nOur solution is a hybrid quantum-classical algorithm that decomposes the problem into a rectangle packing problem and instances of the Traveling Salesman Problem (TSP). The TSP is solved by the Quantum Approximate Optimization Algorithm (QAOA) which is executed on the IBM Quantum System One, located in Ehningen, Germany. Our solution allows an arbitrary number of orientations of the pieces, scales up to a hundred pieces and is able to solve optimally a special class of \"puzzle-like\" problems.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t

\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tTo the Jupyter Notebook on GitHub<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tTo the interactive Jupyter Notebook<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t<\/i>\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t White Paper: A heuristic for solving the irregular strip packing problem<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t
<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Disclaimer<\/h4>

The interactive demonstrator notebooks have been licensed under the Apache licence (version 2.0). The files may only be used in accordance with the licence. A copy of the licence can be downloaded from http:\/\/www.apache.org\/licenses\/LICENSE-2.0<\/a> Except as required by applicable law or agreed to in writing, software distributed under this licence is distributed on an \"AS IS\" basis, without warranties or conditions of any kind, either express or implied. See the licence for the specific rights and restrictions associated with it.<\/span>
This is a research prototype. Liability for loss of profit, loss of production, business interruption, loss of use, loss of data and information, financing costs and other financial and consequential damage is excluded, except in cases of gross negligence, intent and personal injury.<\/span><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"

Kostenoptimierung und Auslegung von Fertigungsstra\u00dfen Einrichten einer Fertigungsstra\u00dfe Fraunhofer IPA Im Demonstrator wird eine Instanz des \u00bbAssembly Line Balancing\u00ab (ALB)-Problems formuliert und gel\u00f6st. Beim ALB soll eine Fertigungsstra\u00dfe f\u00fcr ein bestimmtes Produkt so eingerichtet werden, dass m\u00f6glichst wenig Anschaffungskosten f\u00fcr Maschinen anfallen und eine vorgegebene Taktzeit eingehalten wird. Das Problem wird mathematisch als Quadratisches Unrestringiertes … <\/p>\n

Read more „Kostenoptimierung und Auslegung von Fertigungsstra\u00dfen“<\/span><\/a><\/p>","protected":false},"author":2,"featured_media":9842,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-5476","page","type-page","status-publish","has-post-thumbnail","hentry"],"featured_media_urls":{"thumbnail":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-150x150.jpg",150,150,true],"medium":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-300x117.jpg",300,117,true],"medium_large":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled.jpg",768,301,false],"large":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-1024x401.jpg",950,372,true],"1536x1536":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-1536x602.jpg",1536,602,true],"2048x2048":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-2048x802.jpg",2048,802,true],"trp-custom-language-flag":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-18x7.jpg",18,7,true],"inspiro-featured-image":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-2000x783.jpg",2000,783,true],"inspiro-loop":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-950x320.jpg",950,320,true],"inspiro-loop@2x":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-1900x640.jpg",1900,640,true],"portfolio_item-thumbnail":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-600x400.jpg",600,400,true],"portfolio_item-thumbnail@2x":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-1200x800.jpg",1200,800,true],"portfolio_item-masonry":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-600x235.jpg",600,235,true],"portfolio_item-masonry@2x":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-1200x470.jpg",1200,470,true],"portfolio_item-thumbnail_cinema":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-800x335.jpg",800,335,true],"portfolio_item-thumbnail_portrait":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-600x900.jpg",600,900,true],"portfolio_item-thumbnail_portrait@2x":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-1200x1003.jpg",1200,1003,true],"portfolio_item-thumbnail_square":["https:\/\/www.kqcbw.de\/wp-content\/uploads\/2025\/08\/Banner-Wide_ohne_Schrift-scaled-800x800.jpg",800,800,true]},"_links":{"self":[{"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/pages\/5476","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/comments?post=5476"}],"version-history":[{"count":40,"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/pages\/5476\/revisions"}],"predecessor-version":[{"id":10356,"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/pages\/5476\/revisions\/10356"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/media\/9842"}],"wp:attachment":[{"href":"https:\/\/www.kqcbw.de\/en\/wp-json\/wp\/v2\/media?parent=5476"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}