Three-dimensional Bin Packing Problem with heterogeneous batch constraints

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24210%2F17%3A00004305" target="_blank" >RIV/46747885:24210/17:00004305 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.researchgate.net/publication/320059018_Three-dimensional_Bin_Packing_Problem_with_heterogeneous_batch_constraints" target="_blank" >https://www.researchgate.net/publication/320059018_Three-dimensional_Bin_Packing_Problem_with_heterogeneous_batch_constraints</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Three-dimensional Bin Packing Problem with heterogeneous batch constraints

Popis výsledku v původním jazyce

The new approaches of Industry 4.0 are focusing more and more on proc-ess optimization using principles of artificial intelligence, evolution techniques and computer simulation to achieve both customer and manufacturer goals. One of the biggest issues in this field is to create and optimize production plans. There are lot of well-known solution to a problem of production scheduling of classical homogenous batches, where same types of parts are produced by conventional machines. Never-theless scheduling of heterogeneous batches is still underestimated, thus not imple-mented in general planning and scheduling systems. This article presents possible solution to real world problems where it is necessary to schedule workflow of machines, where it is necessary to take in account its work space while considering several constraints and objective functions. Presented paper is focusing on typical three dimensional bin packing problem, where material of bin assigned parts are influencing total production time and total cost of producing these bin pack batches. Article includes developed constructive algorithm and evolution algorithm which are tested on theoretical examples.

Název v anglickém jazyce

Three-dimensional Bin Packing Problem with heterogeneous batch constraints

Popis výsledku anglicky

The new approaches of Industry 4.0 are focusing more and more on proc-ess optimization using principles of artificial intelligence, evolution techniques and computer simulation to achieve both customer and manufacturer goals. One of the biggest issues in this field is to create and optimize production plans. There are lot of well-known solution to a problem of production scheduling of classical homogenous batches, where same types of parts are produced by conventional machines. Never-theless scheduling of heterogeneous batches is still underestimated, thus not imple-mented in general planning and scheduling systems. This article presents possible solution to real world problems where it is necessary to schedule workflow of machines, where it is necessary to take in account its work space while considering several constraints and objective functions. Presented paper is focusing on typical three dimensional bin packing problem, where material of bin assigned parts are influencing total production time and total cost of producing these bin pack batches. Article includes developed constructive algorithm and evolution algorithm which are tested on theoretical examples.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Mathematical Methods in Economics MME 2017

ISBN

978-80-7435-678-0

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

330-335

Název nakladatele

—

Místo vydání

Hradec Králové

Místo konání akce

Hradec Králové

Datum konání akce

1. 1. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000427151400057