Array
(
[page] => 44
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 20804
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 56143
[vysledek_rok] => 1999
[nazev] => Fuzzy funkční závislosti v relačních databázích
[nazev_orig] => Fuzzy funkční závislosti v relačních databázích
[duvernost_udaju_id] => S
[popis] => Fuzzy funkční závislosti hrají důležitou roli ve fuzzy relačních databázích. Reflektují druh sémantické znalosti o reálném světě a lze je považovat za integritní omezení fuzzy databázového modelu. V příspěvku jsou fuzzy funkční závislosti definovány jako fuzzy rozšíření "obyčejných" funkčních závislostí klasických relačních databází. Je prezentována řada možných rozšíření v závislosti na volbě operátoru fuzzy implikace a jejich využití při určení klíče fuzzy relace a v návrhu datových struktur rozkladem výchozího relačního schématu na několik schémat s cílem odstranit nežádoucí vlastnosti (redundance, aktualizační anomálie).
[popis_orig] => Fuzzy funkční závislosti hrají důležitou roli ve fuzzy relačních databázích. Reflektují druh sémantické znalosti o reálném světě a lze je považovat za integritní omezení fuzzy databázového modelu. V příspěvku jsou fuzzy funkční závislosti definovány jako fuzzy rozšíření "obyčejných" funkčních závislostí klasických relačních databází. Je prezentována řada možných rozšíření v závislosti na volbě operátoru fuzzy implikace a jejich využití při určení klíče fuzzy relace a v návrhu datových struktur rozkladem výchozího relačního schématu na několik schémat s cílem odstranit nežádoucí vlastnosti (redundance, aktualizační anomálie).
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-238-4743-0
[identifikator_popis] => ISBN - Sborník přednášek k 4. ročníku konference Fuzzy logika, neuronové sítě a expertní systémy
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Fuzzy funkční závislosti v relačních databázích. In Sborník přednášek k 4. ročníku konference Fuzzy logika, neuronové sítě a expertní systémy. Hrubá Skála: ADAM Ostrava, 1999. 8 s. ISBN: 80-238-4743-0.
[citace_html] => ŠEDA, M. Fuzzy funkční závislosti v relačních databázích. In Sborník přednášek k 4. ročníku konference Fuzzy logika, neuronové sítě a expertní systémy. Hrubá Skála: ADAM Ostrava, 1999. 8 s. ISBN: 80-238-4743-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20804,
author="Miloš {Šeda}",
title="Fuzzy funkční závislosti v relačních databázích",
booktitle="Sborník přednášek k 4. ročníku konference Fuzzy logika, neuronové sítě a expertní systémy",
year="1999",
pages="8",
publisher="ADAM Ostrava",
address="Hrubá Skála",
isbn="80-238-4743-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Fuzzy Functional Dependencies in Relational Databases
[popis_en] => Fuzzy functional dependencies play an important role in fuzzy relational databases. They reflect a sort of semantic knowledge about the real world and they may be regarded as integrity constraints of a fuzzy database model. In this paper, fuzzy functional dependencies are
defined as fuzzy extensions of "ordinary" functional dependencies of classical relational databases. Several possible extensions are presented depending on the selection of fuzzy implication operator. Their use in determining a key of fuzzy relation and database design based on decomposition into several schemes to avoid bad properties suc redundancy and update anomalies.
[klicova_slova_en] => functional dependency, Armstrong's axioms, key, decomposition, normal forms
[vysledek_datum] => 1999-11-01T00:00:00+01:00
)
[1] => Array
(
[vysledek_id] => 20807
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 56146
[vysledek_rok] => 1999
[nazev] => Scheduling with Fuzzy Processing Times in a Flow Shop
[nazev_orig] => Scheduling with Fuzzy Processing Times in a Flow Shop
[duvernost_udaju_id] => S
[popis] => This paper deals with a permutation flow shop scheduling problem where processing times are given by trapezoidal fuzzy numbers and a makespan is minimised. It describes possible approaches to representing and solving this problem as a multicriteria deterministic problem. Proposed approaches included the use of stochastic heuristic methods (simulated annealing, tabu search, genetic algorithms). Computational results for a selected case of multi-objective problem are presented.
[popis_orig] => This paper deals with a permutation flow shop scheduling problem where processing times are given by trapezoidal fuzzy numbers and a makespan is minimised. It describes possible approaches to representing and solving this problem as a multicriteria deterministic problem. Proposed approaches included the use of stochastic heuristic methods (simulated annealing, tabu search, genetic algorithms). Computational results for a selected case of multi-objective problem are presented.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M., DVOŘÁK, J., MAJER, P.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 3-89653-808-X
[identifikator_popis] => ISBN - Proceedings of the 7th European Congress on Fuzzy and Intelligent Techniques & Soft Computing EUFIT '99
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M., DVOŘÁK, J., MAJER, P. Scheduling with Fuzzy Processing Times in a Flow Shop. In Proceedings of the 7th European Congress on Fuzzy and Intelligent Techniques & Soft Computing EUFIT '99. Aachen: ELITE Foundation, 1999. 2 p. ISBN: 3-89653-808-X.
[citace_html] => ŠEDA, M., DVOŘÁK, J., MAJER, P. Scheduling with Fuzzy Processing Times in a Flow Shop. In Proceedings of the 7th European Congress on Fuzzy and Intelligent Techniques & Soft Computing EUFIT '99. Aachen: ELITE Foundation, 1999. 2 p. ISBN: 3-89653-808-X.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20807,
author="Miloš {Šeda} and Jiří {Dvořák} and Petr {Majer}",
title="Scheduling with Fuzzy Processing Times in a Flow Shop",
booktitle="Proceedings of the 7th European Congress on Fuzzy and Intelligent Techniques & Soft Computing EUFIT '99",
year="1999",
pages="2",
publisher="ELITE Foundation",
address="Aachen",
isbn="3-89653-808-X"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Scheduling with Fuzzy Processing Times in a Flow Shop
[popis_en] => This paper deals with a permutation flow shop scheduling problem where processing times are given by trapezoidal fuzzy numbers and a makespan is minimised. It describes possible approaches to representing and solving this problem as a multicriteria deterministic problem. Proposed approaches included the use of stochastic heuristic methods (simulated annealing, tabu search, genetic algorithms). Computational results for a selected case of multi-objective problem are presented.
[klicova_slova_en] => flow shop scheduling, fuzzy processing times, heuristic methods
[vysledek_datum] => 1999-09-14T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 20811
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 56157
[vysledek_rok] => 1999
[nazev] => Solving Steiner Tree Problem Using Local Search Methods
[nazev_orig] => Solving Steiner Tree Problem Using Local Search Methods
[duvernost_udaju_id] => S
[popis] => The Steiner tree problem (STP) on a graph involves finding a minimum cost tree which connects a designated subset of the nodes in the graph. This problem generalizes the minimum spanning tree problem and is more complicated since there are Steiner nodes which are not in the designated subset but may or may not be connected by the Steiner tree solution. Variants of the basic network Steiner tree model (Euclidean, rectilinear) can arise in the design of telecommunication networks where customers must be connected to a switching centre. The paper describes solution representations used in heuristic techniques for solving STP.
[popis_orig] => The Steiner tree problem (STP) on a graph involves finding a minimum cost tree which connects a designated subset of the nodes in the graph. This problem generalizes the minimum spanning tree problem and is more complicated since there are Steiner nodes which are not in the designated subset but may or may not be connected by the Steiner tree solution. Variants of the basic network Steiner tree model (Euclidean, rectilinear) can arise in the design of telecommunication networks where customers must be connected to a switching centre. The paper describes solution representations used in heuristic techniques for solving STP.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-214-1154-6
[identifikator_popis] => ISBN - Proceedings of the 22nd International Conference Telecommunications and Signal Processing TSP ‘99
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Solving Steiner Tree Problem Using Local Search Methods. In Proceedings of the 22nd International Conference Telecommunications and Signal Processing TSP ‘99. Brno: VUT FEI v Brně, 1999. 4 p. ISBN: 80-214-1154-6.
[citace_html] => ŠEDA, M. Solving Steiner Tree Problem Using Local Search Methods. In Proceedings of the 22nd International Conference Telecommunications and Signal Processing TSP ‘99. Brno: VUT FEI v Brně, 1999. 4 p. ISBN: 80-214-1154-6.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20811,
author="Miloš {Šeda}",
title="Solving Steiner Tree Problem Using Local Search Methods",
booktitle="Proceedings of the 22nd International Conference Telecommunications and Signal Processing TSP ‘99",
year="1999",
pages="4",
publisher="VUT FEI v Brně",
address="Brno",
isbn="80-214-1154-6"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Solving Steiner Tree Problem Using Local Search Methods
[popis_en] => The Steiner tree problem (STP) on a graph involves finding a minimum cost tree which connects a designated subset of the nodes in the graph. This problem generalizes the minimum spanning tree problem and is more complicated since there are Steiner nodes which are not in the designated subset but may or may not be connected by the Steiner tree solution. Variants of the basic network Steiner tree model (Euclidean, rectilinear) can arise in the design of telecommunication networks where customers must be connected to a switching centre. The paper describes solution representations used in heuristic techniques for solving STP.
[klicova_slova_en] => network Steiner tree problem, enumeration methods, stochastic heuristics
[vysledek_datum] => 1999-09-01T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 20813
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 56161
[vysledek_rok] => 1999
[nazev] => Scheduling Job Shops Using Genetic Algorithms and Local Search Framework
[nazev_orig] => Scheduling Job Shops Using Genetic Algorithms and Local Search Framework
[duvernost_udaju_id] => S
[popis] => This paper provides a comparison of the application of stochastic heuristic techniques (genetic algorithms, simulated annealing and tabu search) to job shop scheduling. It presents computational results achieved for three typical representation schemes using standard benchmark problems.
[popis_orig] => This paper provides a comparison of the application of stochastic heuristic techniques (genetic algorithms, simulated annealing and tabu search) to job shop scheduling. It presents computational results achieved for three typical representation schemes using standard benchmark problems.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.; DVOŘÁK, J.; BURDA, J.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-214-1131-7
[identifikator_popis] => ISBN - Proceedings of the 5th International Conference on Soft Computing
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M.; DVOŘÁK, J.; BURDA, J. Scheduling Job Shops Using Genetic Algorithms and Local Search Framework. In Proceedings of the 5th International Conference on Soft Computing. Brno: VUT FSI v Brně, 1999. 8 p. ISBN: 80-214-1131-7.
[citace_html] => ŠEDA, M.; DVOŘÁK, J.; BURDA, J. Scheduling Job Shops Using Genetic Algorithms and Local Search Framework. In Proceedings of the 5th International Conference on Soft Computing. Brno: VUT FSI v Brně, 1999. 8 p. ISBN: 80-214-1131-7.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20813,
author="Miloš {Šeda} and Jiří {Dvořák} and Jiří {Burda}",
title="Scheduling Job Shops Using Genetic Algorithms and Local Search Framework",
booktitle="Proceedings of the 5th International Conference on Soft Computing",
year="1999",
pages="8",
publisher="VUT FSI v Brně",
address="Brno",
isbn="80-214-1131-7"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Scheduling Job Shops Using Genetic Algorithms and Local Search Framework
[popis_en] => This paper provides a comparison of the application of stochastic heuristic techniques (genetic algorithms, simulated annealing and tabu search) to job shop scheduling. It presents computational results achieved for three typical representation schemes using standard benchmark problems.
[klicova_slova_en] => job shop scheduling, stochastic heuristic methods, disjunctive graph
[vysledek_datum] => 1999-06-01T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 20814
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 56162
[vysledek_rok] => 1999
[nazev] => Rozvrhování s fuzzy termíny dokončení úloh a fuzzy trváním operací
[nazev_orig] => Rozvrhování s fuzzy termíny dokončení úloh a fuzzy trváním operací
[duvernost_udaju_id] => S
[popis] => Práce se zabývá uplatněním fuzzy přístupů v rozvrhování. Omezuje se na základní podobu problému permutačního rozvrhování proudové výroby, kde kromě strojů nejsou uvažovány žádné jiné omezené zdroje. Jsou zde zkoumány dva případy výskytu neurčitosti v problému rozvrhování – neurčitosti termínů dokončení úloh a neurčitosti dob trvání operací. Nejprve je analyzován případ fuzzy termínů dokončení úloh a pak je navržen model kombinující fuzzy termíny dokončení a fuzzy trvání operací. Tyto modely jsou řešeny pomocí stochastických heuristických metod.
[popis_orig] => Práce se zabývá uplatněním fuzzy přístupů v rozvrhování. Omezuje se na základní podobu problému permutačního rozvrhování proudové výroby, kde kromě strojů nejsou uvažovány žádné jiné omezené zdroje. Jsou zde zkoumány dva případy výskytu neurčitosti v problému rozvrhování – neurčitosti termínů dokončení úloh a neurčitosti dob trvání operací. Nejprve je analyzován případ fuzzy termínů dokončení úloh a pak je navržen model kombinující fuzzy termíny dokončení a fuzzy trvání operací. Tyto modely jsou řešeny pomocí stochastických heuristických metod.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MAJER, P., DVOŘÁK, J., ŠEDA, M.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-238-4743-0
[identifikator_popis] => ISBN - Fuzzy logika, neuronové sítě a expertní systémy
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => MAJER, P., DVOŘÁK, J., ŠEDA, M. Rozvrhování s fuzzy termíny dokončení úloh a fuzzy trváním operací. In Fuzzy logika, neuronové sítě a expertní systémy. Ostrava: AD&M, 1999. 8 s. ISBN: 80-238-4743-0.
[citace_html] => MAJER, P., DVOŘÁK, J., ŠEDA, M. Rozvrhování s fuzzy termíny dokončení úloh a fuzzy trváním operací. In Fuzzy logika, neuronové sítě a expertní systémy. Ostrava: AD&M, 1999. 8 s. ISBN: 80-238-4743-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20814,
author="Petr {Majer} and Jiří {Dvořák} and Miloš {Šeda}",
title="Rozvrhování s fuzzy termíny dokončení úloh a fuzzy trváním operací",
booktitle="Fuzzy logika, neuronové sítě a expertní systémy",
year="1999",
pages="8",
publisher="AD&M",
address="Ostrava",
isbn="80-238-4743-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Scheduling with fuzzy due dates of jobs and fuzzy processing times of operations
[popis_en] => The paper deals with application of fuzzy approaches to scheduling. It is restricted to the basic form of a permutation flow shop scheduling problem, where, excepting machines, no constrained resources are considered. Two cases of uncertainties in the scheduling problem are studied – uncertain due dates of jobs and uncertain processing times of operations. First, the case of fuzzy due dates is analyzed, and then a model combining fuzzy due dates and fuzzy processing times is proposed. These models are solved by means of stochastic heuristic methods.
[klicova_slova_en] => Flow shop scheduling, fuzzy constraints, stochastic heuristic methods
[vysledek_datum] => 1999-11-01T00:00:00+01:00
)
[5] => Array
(
[vysledek_id] => 20815
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 56165
[vysledek_rok] => 1999
[nazev] => Stochastic Heuristic Techniques for Scheduling Job Shops
[nazev_orig] => Stochastic Heuristic Techniques for Scheduling Job Shops
[duvernost_udaju_id] => S
[popis] => Job-shop scheduling problems belong to the class of NP-hard problems and therefore exact solution methods can be used only for very simple cases. This paper focuses on solving this problem by means of stochastic heuristic methods (simulated annealing, tabu search and genetic algorithms). It presents computational results achieved for two typical representation schemes using standard benchmark problems.
[popis_orig] => Job-shop scheduling problems belong to the class of NP-hard problems and therefore exact solution methods can be used only for very simple cases. This paper focuses on solving this problem by means of stochastic heuristic methods (simulated annealing, tabu search and genetic algorithms). It presents computational results achieved for two typical representation schemes using standard benchmark problems.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M., DVOŘÁK, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-227-1228-0
[identifikator_popis] => ISBN - Proceedings of the 12th Conference PROCESS CONTROL ‘99
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M., DVOŘÁK, J. Stochastic Heuristic Techniques for Scheduling Job Shops. In Proceedings of the 12th Conference PROCESS CONTROL ‘99. Tatranské Matliare: STU Bratislava, 1999. 5 p. ISBN: 80-227-1228-0.
[citace_html] => ŠEDA, M., DVOŘÁK, J. Stochastic Heuristic Techniques for Scheduling Job Shops. In Proceedings of the 12th Conference PROCESS CONTROL ‘99. Tatranské Matliare: STU Bratislava, 1999. 5 p. ISBN: 80-227-1228-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20815,
author="Miloš {Šeda} and Jiří {Dvořák}",
title="Stochastic Heuristic Techniques for Scheduling Job Shops",
booktitle="Proceedings of the 12th Conference PROCESS CONTROL ‘99",
year="1999",
pages="5",
publisher="STU Bratislava",
address="Tatranské Matliare",
isbn="80-227-1228-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Stochastic Heuristic Techniques for Scheduling Job Shops
[popis_en] => Job-shop scheduling problems belong to the class of NP-hard problems and therefore exact solution methods can be used only for very simple cases. This paper focuses on solving this problem by means of stochastic heuristic methods (simulated annealing, tabu search and genetic algorithms). It presents computational results achieved for two typical representation schemes using standard benchmark problems.
[klicova_slova_en] => job shop, scheduling, heuristics
[vysledek_datum] => 1999-06-01T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 20817
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 56167
[vysledek_rok] => 1999
[nazev] => Fuzzy Approaches to Flow Shop Scheduling
[nazev_orig] => Fuzzy Approaches to Flow Shop Scheduling
[duvernost_udaju_id] => S
[popis] => Scheduling problems we can meet in many practical applications, e.g. in production management (flow shop scheduling, job shop scheduling), project management, timetabling, etc. The common feature of these problems is their combinatorial character. In practical problems a space of feasible solutions is so large that it is impossible to search the optimal solution by testing each solution. From this reason heuristic (approximate) methods are preferred to searching a solution, and among them especially stochastic methods (genetic algorithms, simulated annealing and tabu-search)
are used.
[popis_orig] => Scheduling problems we can meet in many practical applications, e.g. in production management (flow shop scheduling, job shop scheduling), project management, timetabling, etc. The common feature of these problems is their combinatorial character. In practical problems a space of feasible solutions is so large that it is impossible to search the optimal solution by testing each solution. From this reason heuristic (approximate) methods are preferred to searching a solution, and among them especially stochastic methods (genetic algorithms, simulated annealing and tabu-search)
are used.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M., DVOŘÁK, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-85988-33-X
[identifikator_popis] => ISBN - Proceedings of the 33rd Spring International Conference Modelling and Simulation of Systems MOSIS '99
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M., DVOŘÁK, J. Fuzzy Approaches to Flow Shop Scheduling. In Proceedings of the 33rd Spring International Conference Modelling and Simulation of Systems MOSIS '99. Rožnov pod Radhoštěm: MARQ Ostrava, 1999. 8 p. ISBN: 80-85988-33-X.
[citace_html] => ŠEDA, M., DVOŘÁK, J. Fuzzy Approaches to Flow Shop Scheduling. In Proceedings of the 33rd Spring International Conference Modelling and Simulation of Systems MOSIS '99. Rožnov pod Radhoštěm: MARQ Ostrava, 1999. 8 p. ISBN: 80-85988-33-X.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20817,
author="Miloš {Šeda} and Jiří {Dvořák}",
title="Fuzzy Approaches to Flow Shop Scheduling",
booktitle="Proceedings of the 33rd Spring International Conference Modelling and Simulation of Systems MOSIS '99",
year="1999",
pages="8",
publisher="MARQ Ostrava",
address="Rožnov pod Radhoštěm",
isbn="80-85988-33-X"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Fuzzy Approaches to Flow Shop Scheduling
[popis_en] => Scheduling problems we can meet in many practical applications, e.g. in production management (flow shop scheduling, job shop scheduling), project management, timetabling, etc. The common feature of these problems is their combinatorial character. In practical problems a space of feasible solutions is so large that it is impossible to search the optimal solution by testing each solution. From this reason heuristic (approximate) methods are preferred to searching a solution, and among them especially stochastic methods (genetic algorithms, simulated annealing and tabu-search)
are used.
[klicova_slova_en] => flow shop scheduling, fuzzy constraints, heuristic methods
[vysledek_datum] => 1999-04-01T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 20819
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 56172
[vysledek_rok] => 1999
[nazev] => Rozvrhování proudové výroby pomocí stochastických heuristických metod
[nazev_orig] => Rozvrhování proudové výroby pomocí stochastických heuristických metod
[duvernost_udaju_id] => S
[popis] => V příspěvku je popsána aplikace tří heuristických technik (simulované žíhání, tabu-search a genetické algoritmy) k permutační verzi problému rozvrhování sériové výroby s účelovou funkcí minimalizující celkovou dobu provedení všech operací. Na řešení testovacích úloh jsou odzkoušena a porovnána nastavení parametrů pro problémově orientované prohledávání sousedství aktuálního řešení a parametrů genetického algoritmu včetně tradičního operátoru úlohy obchodního cestujícího. Výpočty genetickými algoritmy ukazují velmi dobrou kvalitu získaných řešení.
[popis_orig] => V příspěvku je popsána aplikace tří heuristických technik (simulované žíhání, tabu-search a genetické algoritmy) k permutační verzi problému rozvrhování sériové výroby s účelovou funkcí minimalizující celkovou dobu provedení všech operací. Na řešení testovacích úloh jsou odzkoušena a porovnána nastavení parametrů pro problémově orientované prohledávání sousedství aktuálního řešení a parametrů genetického algoritmu včetně tradičního operátoru úlohy obchodního cestujícího. Výpočty genetickými algoritmy ukazují velmi dobrou kvalitu získaných řešení.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M., DVOŘÁK, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-214-1341-7
[identifikator_popis] => ISBN - Sborník konference Transfer '99
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M., DVOŘÁK, J. Rozvrhování proudové výroby pomocí stochastických heuristických metod. In Sborník konference Transfer '99. Brno: VUT FSI v Brně, 1999. 2 s. ISBN: 80-214-1341-7.
[citace_html] => ŠEDA, M., DVOŘÁK, J. Rozvrhování proudové výroby pomocí stochastických heuristických metod. In Sborník konference Transfer '99. Brno: VUT FSI v Brně, 1999. 2 s. ISBN: 80-214-1341-7.
[citace_rtf] =>
[citace_bibtex] =>
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Flow Shop Scheduling Using Stochastic Heuristických Methods
[popis_en] => In this paper, we apply three heuristic techniques (simulated annealing, tabu-search, and genetic algorithm) to permutation flowshop scheduling problem with the objective minimizing makespan. Solving some benchmark problems, we examine and compare various problem-oriented neighbourhood search and genetic operators including traditional TSP operators. Results of these tests show a good performance of genetic algorithms.
[klicova_slova_en] => flow shop, scheduling, stochastic heuristics
[vysledek_datum] => 1999-06-01T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 44
[count] => 8
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /veda/publikace/detail/
[base_page] => /veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => ŠEDA, M.
[title] => Fuzzy funkční závislosti v relačních databázích
[typ] => PV
[year] => 1999
[id_vav] => 20804
)
[1] => Array
(
[quotations] => ŠEDA, M., DVOŘÁK, J., MAJER, P.
[title] => Scheduling with Fuzzy Processing Times in a Flow Shop
[typ] => PV
[year] => 1999
[id_vav] => 20807
)
[2] => Array
(
[quotations] => ŠEDA, M.
[title] => Solving Steiner Tree Problem Using Local Search Methods
[typ] => PV
[year] => 1999
[id_vav] => 20811
)
[3] => Array
(
[quotations] => ŠEDA, M.; DVOŘÁK, J.; BURDA, J.
[title] => Scheduling Job Shops Using Genetic Algorithms and Local Search Framework
[typ] => PV
[year] => 1999
[id_vav] => 20813
)
[4] => Array
(
[quotations] => MAJER, P., DVOŘÁK, J., ŠEDA, M.
[title] => Rozvrhování s fuzzy termíny dokončení úloh a fuzzy trváním operací
[typ] => PV
[year] => 1999
[id_vav] => 20814
)
[5] => Array
(
[quotations] => ŠEDA, M., DVOŘÁK, J.
[title] => Stochastic Heuristic Techniques for Scheduling Job Shops
[typ] => PV
[year] => 1999
[id_vav] => 20815
)
[6] => Array
(
[quotations] => ŠEDA, M., DVOŘÁK, J.
[title] => Fuzzy Approaches to Flow Shop Scheduling
[typ] => PV
[year] => 1999
[id_vav] => 20817
)
[7] => Array
(
[quotations] => ŠEDA, M., DVOŘÁK, J.
[title] => Rozvrhování proudové výroby pomocí stochastických heuristických metod
[typ] => PV
[year] => 1999
[id_vav] => 20819
)
)
)