All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Three-dimensional Bin Packing Problem with heterogeneous batch constraints

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Three-dimensional Bin Packing Problem with heterogeneous batch constraints

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2017

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Mathematical Methods in Economics MME 2017

  • ISBN

    978-80-7435-678-0

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    330-335

  • Publisher name

  • Place of publication

    Hradec Králové

  • Event location

    Hradec Králové

  • Event date

    Jan 1, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000427151400057