Uz grafiem balstītie darbu plānošanas algoritmi
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
lav
Abstract
Bakalaura darbā aprakstīti divu veidu grafi (disjunktīvais grafs un divpusējais grafs), kurus izmanto general shop problēmu atrisināšanai. Darbā tika aplūkotas open shop un job shop problēmas, kuru atrisinājuma iegūšanai ar grafu palīdzību tika izmantotas loku krāsošanas, divpusējās saskaņošanas un bootleneck metodes.
In the theses two different graph models used for general shop scheduling problems are described – disjunctive graphs, bipartite graphs. Arc coloring, bipartite matching method and shifting bottleneck algorithm are used to solve open shop and job shop scheduling problems based on graph models.
In the theses two different graph models used for general shop scheduling problems are described – disjunctive graphs, bipartite graphs. Arc coloring, bipartite matching method and shifting bottleneck algorithm are used to solve open shop and job shop scheduling problems based on graph models.