Publication detail
Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations
ŠEDA, M. ŠEDA, P. ŠEDOVÁ, J.
Czech title
Rozvrhování zakázkové výroby a její fuzzifikace založená na reprezentaci operacemi a disjunktivním grafem
English title
Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations
Type
conference paper
Language
en
Original abstract
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.
Czech abstract
V tomto článku je uvedeno několik přístupů k problému rozvrhováním zakázkové výroby. Je odvozen model smíšeného celočíselného programování a poté implementován v optimalizačním sw nástroji GAMS. Protože tento problém je NP-těžký hard, tento přístup nelze použít pro velké instance problému, hranice aplikovatelnosti jsou indikovány s využitím benchmarků z ORLibrary. Zde jsou aplikovány strategie založené na reprezentacích pomocí operací a disjunktivním grafem a jejich časové složitosti jsou odvozeny. Tyto reprezentace jsou rovněž využity k heuristickému generování přípustných řešení z jejich prohledávácího prostoru. V závěrečné části je popsána modifikace pro případ nedeterministických prováděcích časů operací úloh, založená na fuzzy číslech. Jsou také diskutovány metody porovnávání fuzzy čísel.
English abstract
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.
Keywords in Czech
zakázková výroba, smšení celočíselné programování, disjunktivní graf, CPM, heuristika, fuzzy číslo
Keywords in English
job shop, mixed integer programming, disjunctive graph, CPM, heuristic, fuzzy number
Released
28.10.2019
Location
Dublin
ISBN
978-1-7281-5763-4
Book
2019 11th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT)
Pages from–to
161–165
Pages count
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",
month="October",
pages="161--165",
address="Dublin ",
isbn="978-1-7281-5763-4"
}