Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
ŠEDA, M.; ŠEDA, P.; ŠEDOVÁ, J.
Originální název
Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations
Anglický název
Druh
Stať ve sborníku v databázi WoS či Scopus
Originální abstrakt
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.
Anglický abstrakt
Klíčová slova
job shop, mixed integer programming, disjunctive graph, CPM, heuristic, fuzzy number
Klíčová slova v angličtině
Autoři
Rok RIV
2020
Vydáno
28.10.2019
Místo
Dublin
ISBN
978-1-7281-5763-4
Kniha
2019 11th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT)
Strany od
161
Strany do
165
Strany počet
5
BibTex
@inproceedings{BUT159902, author="Miloš {Šeda} and Pavel {Šeda} and Jindřiška {Šedová}", title="Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations", booktitle="2019 11th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT)", year="2019", pages="161--165", address="Dublin", doi="10.1109/ICUMT48472.2019.8971003", isbn="978-1-7281-5763-4" }