Three dimensional Bin Packing Problem in batch scheduling

Kód výsledku v 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>

Výsledek na webu

<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

—

Jazyk výsledku

angličtina

Název v původním jazyce

Three dimensional Bin Packing Problem in batch scheduling

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Three dimensional Bin Packing Problem in batch scheduling

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2016

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

34th International Conference Mathematical Methods in Economics (MME)

ISBN

978-80-7494-296-9

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

407-412

Název nakladatele

—

Místo vydání

Liberec

Místo konání akce

Liberec

Datum konání akce

1. 1. 2016

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

WRD - Celosvětová akce

Kód UT WoS článku

000385239500070