Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F19%3APU134116" target="_blank" >RIV/00216305:26210/19:PU134116 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/ICUMT48472.2019.8971003" target="_blank" >http://dx.doi.org/10.1109/ICUMT48472.2019.8971003</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ICUMT48472.2019.8971003" target="_blank" >10.1109/ICUMT48472.2019.8971003</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations

Popis výsledku v původním jazyce

In this paper, several approaches to job shop scheduling problem are presented. A mixed integer programming model is derived and, based on this result, it is implemented in the GAMS optimisation software tool. Since the problem is NPhard, this approach may not be used for large instances, its reasonable bounds are indicated using benchmarks from ORLibrary. Here, strategies based on operations and disjunctive graph representations are applied and their time complexities are derived. These representations are also used to heuristically generate feasible solutions from their searching space. Finally, a modification is described of the problem using uncertain processing times of jobs based on fuzzy numbers. Methods for comparing fuzzy numbers are then discussed.

Název v anglickém jazyce

Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations

Popis výsledku anglicky

In this paper, several approaches to job shop scheduling problem are presented. A mixed integer programming model is derived and, based on this result, it is implemented in the GAMS optimisation software tool. Since the problem is NPhard, this approach may not be used for large instances, its reasonable bounds are indicated using benchmarks from ORLibrary. Here, strategies based on operations and disjunctive graph representations are applied and their time complexities are derived. These representations are also used to heuristically generate feasible solutions from their searching space. Finally, a modification is described of the problem using uncertain processing times of jobs based on fuzzy numbers. Methods for comparing fuzzy numbers are then discussed.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20205 - Automation and control systems

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

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

2019 11th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT)

ISBN

978-1-7281-5763-4

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

161-165

Název nakladatele

Neuveden

Místo vydání

Dublin

Místo konání akce

Dublin

Datum konání akce

28. 10. 2019

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

WRD - Celosvětová akce

Kód UT WoS článku

000540651700074