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 in batch scheduling

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24210%2F16%3A00000550" target="_blank" >RIV/46747885:24210/16:00000550 - isvavai.cz</a>

  • Result on the web

    <a href="http://mme2016.tul.cz/conferenceproceedings/mme2016_conference_proceedings.pdf" target="_blank" >http://mme2016.tul.cz/conferenceproceedings/mme2016_conference_proceedings.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Three dimensional Bin Packing Problem in batch scheduling

  • Original language description

    Nowadays planning is aided with Advanced Planning and Scheduling Systems that are calculating with constrained capacities. However there is used common scheduling approach of assigning jobs to resources that complete the work in specific time. Processing tasks, which are composed from segments of several preceding jobs, are not scheduled in this way, but long term planning approach is used. This paper is following recent trends in manufacturing systems and operations research focusing on scheduling special technologies as rapid prototyping, heat treatment or surface finishing technologies. These technologies require two stage scheduling approach of work space partitioning and classical batch scheduling. This article is proposing early research done by reviewing three dimensional Bin Packing Problem and by developing and testing constructive algorithm inspired by MinfMaxr approach with goal to discuss further approach of special technologies batch scheduling. Batch scheduling scheme and its possible implementation in to Advanced Planning and Scheduling system is than discussed.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BB - Applied statistics, operational research

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2016

  • 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

    34th International Conference Mathematical Methods in Economics (MME)

  • ISBN

    978-80-7494-296-9

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    407-412

  • Publisher name

  • Place of publication

    Liberec

  • Event location

    Liberec

  • Event date

    Jan 1, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000385239500070