Bin Packing And Scheduling with Due Dates

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24210%2F18%3A00005651" target="_blank" >RIV/46747885:24210/18:00005651 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Bin Packing And Scheduling with Due Dates

Popis výsledku v původním jazyce

This paper is presenting combination of classical single machine batch scheduling problem with capacity constraint. Unlike most cases, where capacity problem is considered as one dimensional packing or knapsack problem, in this pa-per processor capacity is represented by 3D bin packing problem. This research is inspired by real world problems, as scheduling of the heat-treatment furnace, where it is necessary to schedule workflow of machines. That usually con-sist of heterogeneous job batches and it is necessary to take in account its work space while also considering technological constraints. There is proposed early research done by reviewing problems as single machine batch scheduling, Bin packing problem and scheduling problem with objective func-tion of lateness. There are also suggested theoretical models based on the practical example of heat treating operations which are describing combination of before mentioned packing and scheduling problems. Constructive algorithm and random key based evolution algorithm are then tested on these problems to discuss its practi-cal applications.

Název v anglickém jazyce

Bin Packing And Scheduling with Due Dates

Popis výsledku anglicky

This paper is presenting combination of classical single machine batch scheduling problem with capacity constraint. Unlike most cases, where capacity problem is considered as one dimensional packing or knapsack problem, in this pa-per processor capacity is represented by 3D bin packing problem. This research is inspired by real world problems, as scheduling of the heat-treatment furnace, where it is necessary to schedule workflow of machines. That usually con-sist of heterogeneous job batches and it is necessary to take in account its work space while also considering technological constraints. There is proposed early research done by reviewing problems as single machine batch scheduling, Bin packing problem and scheduling problem with objective func-tion of lateness. There are also suggested theoretical models based on the practical example of heat treating operations which are describing combination of before mentioned packing and scheduling problems. Constructive algorithm and random key based evolution algorithm are then tested on these problems to discuss its practi-cal applications.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

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

36th International Conference on Mathematical Methods in Economics (MME)

ISBN

978-80-7378-372-3

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

222-227

Název nakladatele

MatfyzPress

Místo vydání

Jindřichův Hradec

Místo konání akce

Jindřichův Hradec

Datum konání akce

1. 1. 2018

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

WRD - Celosvětová akce

Kód UT WoS článku

000507455300039