Array
(
[page] => 22
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 10555
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 31547
[vysledek_rok] => 2002
[nazev] => Fuzzy Job Shop Scheduling
[nazev_orig] => Fuzzy Job Shop Scheduling
[duvernost_udaju_id] => S
[popis] => This paper deals with a fuzzy job shop scheduling problem where due dates of jobs and processing times of job operations are modeled by trapezoidal fuzzy numbers. In the deterministic case, decision criteria are functions of the job completion times. We describe and discuss some approaches to the construction of decision criteria for the fuzzy case, propose new criteria and suggest a way of experimental comparison of these criteria. We also study corresponding neighborhood structures for applying local search methods.
[popis_orig] => This paper deals with a fuzzy job shop scheduling problem where due dates of jobs and processing times of job operations are modeled by trapezoidal fuzzy numbers. In the deterministic case, decision criteria are functions of the job completion times. We describe and discuss some approaches to the construction of decision criteria for the fuzzy case, propose new criteria and suggest a way of experimental comparison of these criteria. We also study corresponding neighborhood structures for applying local search methods.
[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] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => DVOŘÁK, J., MAJER, P.
[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 3-9808089-2-0
[identifikator_popis] => ISBN - Proceedings of the East West Fuzzy Colloquium 2002 and 10th Zittau Fuzzy Colloquium
[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] => DVOŘÁK, J., MAJER, P. Fuzzy Job Shop Scheduling. In Proceedings of the East West Fuzzy Colloquium 2002 and 10th Zittau Fuzzy Colloquium. Zittau, Germany: Hochschule Zittau/Goerlitz, 2002. 8 p. ISBN: 3-9808089-2-0.
[citace_html] => DVOŘÁK, J., MAJER, P. Fuzzy Job Shop Scheduling. In Proceedings of the East West Fuzzy Colloquium 2002 and 10th Zittau Fuzzy Colloquium. Zittau, Germany: Hochschule Zittau/Goerlitz, 2002. 8 p. ISBN: 3-9808089-2-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT10555,
author="Jiří {Dvořák} and Petr {Majer}",
title="Fuzzy Job Shop Scheduling",
booktitle="Proceedings of the East West Fuzzy Colloquium 2002 and 10th Zittau Fuzzy Colloquium",
year="2002",
pages="8",
publisher="Hochschule Zittau/Goerlitz",
address="Zittau, Germany",
isbn="3-9808089-2-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] => Fuzzy Job Shop Scheduling
[popis_en] => This paper deals with a fuzzy job shop scheduling problem where due dates of jobs and processing times of job operations are modeled by trapezoidal fuzzy numbers. In the deterministic case, decision criteria are functions of the job completion times. We describe and discuss some approaches to the construction of decision criteria for the fuzzy case, propose new criteria and suggest a way of experimental comparison of these criteria. We also study corresponding neighborhood structures for applying local search methods.
[klicova_slova_en] => job shop scheduling, fuzzy due date, fuzzy processing time
[vysledek_datum] => 2002-09-01T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 10556
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 31548
[vysledek_rok] => 2002
[nazev] => Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem
[nazev_orig] => Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem
[duvernost_udaju_id] => S
[popis] => This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure represented by a directed acyclic network, where each node may have several predecessors and/or successors. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horizon. We propose the methods for solving this problem based on genetic algorithms.
[popis_orig] => This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure represented by a directed acyclic network, where each node may have several predecessors and/or successors. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horizon. We propose the methods for solving this problem based on genetic algorithms.
[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] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => DVOŘÁK, J., MARTINEK, V., KRÁL, 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-2135-5
[identifikator_popis] => ISBN - Proceedings of the 8th International Conference on Soft Computing MENDEL 2002
[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] => DVOŘÁK, J., MARTINEK, V., KRÁL, J. Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem. In Proceedings of the 8th International Conference on Soft Computing MENDEL 2002. Brno, Czech Republic: Brno University of Technology, 2002. 131 p. ISBN: 80-214-2135-5.
[citace_html] => DVOŘÁK, J., MARTINEK, V., KRÁL, J. Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem. In Proceedings of the 8th International Conference on Soft Computing MENDEL 2002. Brno, Czech Republic: Brno University of Technology, 2002. 131 p. ISBN: 80-214-2135-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT10556,
author="Jiří {Dvořák} and Vlastimil {Martinek} and Jan {Král}",
title="Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem",
booktitle="Proceedings of the 8th International Conference on Soft Computing MENDEL 2002",
year="2002",
pages="131",
publisher="Brno University of Technology",
address="Brno, Czech Republic",
isbn="80-214-2135-5"
}
[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] => Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem
[popis_en] => This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure represented by a directed acyclic network, where each node may have several predecessors and/or successors. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horizon. We propose the methods for solving this problem based on genetic algorithms.
[klicova_slova_en] => dynamic lot sizing, general product structure, multiple constrained resources, genetic algorithms
[vysledek_datum] => 2002-06-01T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 10557
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 31549
[vysledek_rok] => 2002
[nazev] => Modeling Job Shop Scheduling Problem for Real-Life Conditions
[nazev_orig] => Modeling Job Shop Scheduling Problem for Real-Life Conditions
[duvernost_udaju_id] => S
[popis] => This paper describes a model of job shop scheduling, which covers the most frequent conditions of real-life production: assembly and distribution operations, release dates, setup and transfer times, overlapping processes. As a modeling tool we choose an extended disjunctive graph. The resulting model can be solved by means of stochastic heuristic methods (simulated annealing, taboo search, genetic algorithms). An example solved by simulated annealing is presented.
[popis_orig] => This paper describes a model of job shop scheduling, which covers the most frequent conditions of real-life production: assembly and distribution operations, release dates, setup and transfer times, overlapping processes. As a modeling tool we choose an extended disjunctive graph. The resulting model can be solved by means of stochastic heuristic methods (simulated annealing, taboo search, genetic algorithms). An example solved by simulated annealing is presented.
[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] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MAJER, P., 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-2135-5
[identifikator_popis] => ISBN - Proceedings of the 8th International Conference on Soft Computing MENDEL 2002
[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] => MAJER, P., DVOŘÁK, J. Modeling Job Shop Scheduling Problem for Real-Life Conditions. In Proceedings of the 8th International Conference on Soft Computing MENDEL 2002. Brno, Czech Republic: Brno University of Technology, 2002. 362 p. ISBN: 80-214-2135-5.
[citace_html] => MAJER, P., DVOŘÁK, J. Modeling Job Shop Scheduling Problem for Real-Life Conditions. In Proceedings of the 8th International Conference on Soft Computing MENDEL 2002. Brno, Czech Republic: Brno University of Technology, 2002. 362 p. ISBN: 80-214-2135-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT10557,
author="Petr {Majer} and Jiří {Dvořák}",
title="Modeling Job Shop Scheduling Problem for Real-Life Conditions",
booktitle="Proceedings of the 8th International Conference on Soft Computing MENDEL 2002",
year="2002",
pages="362",
publisher="Brno University of Technology",
address="Brno, Czech Republic",
isbn="80-214-2135-5"
}
[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] => Modeling Job Shop Scheduling Problem for Real-Life Conditions
[popis_en] => This paper describes a model of job shop scheduling, which covers the most frequent conditions of real-life production: assembly and distribution operations, release dates, setup and transfer times, overlapping processes. As a modeling tool we choose an extended disjunctive graph. The resulting model can be solved by means of stochastic heuristic methods (simulated annealing, taboo search, genetic algorithms). An example solved by simulated annealing is presented.
[klicova_slova_en] => job shop scheduling, disjunctive graph, transfer batches, assembly/distribution operations
[vysledek_datum] => 2002-06-01T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 10558
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 31550
[vysledek_rok] => 2002
[nazev] => Solving a Capacitated Dynamic Lot Sizing Problem
[nazev_orig] => Solving a Capacitated Dynamic Lot Sizing Problem
[duvernost_udaju_id] => S
[popis] => This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horizon. We propose a method for solving this problem based on genetic algorithms
[popis_orig] => This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horizon. We propose a method for solving this problem based on genetic algorithms
[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] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MARTINEK, V., 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 3/901509-29-1
[identifikator_popis] => ISBN - In Annals of DAAAM for 2002 & Proceedings of the 13th International DAAAM Symposium
[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] => MARTINEK, V., DVOŘÁK, J. Solving a Capacitated Dynamic Lot Sizing Problem. In In Annals of DAAAM for 2002 & Proceedings of the 13th International DAAAM Symposium. Vienna, Austria: DAAAM International Vienna, 2002. 344 p. ISBN: 3/901509-29-1.
[citace_html] => MARTINEK, V., DVOŘÁK, J. Solving a Capacitated Dynamic Lot Sizing Problem. In In Annals of DAAAM for 2002 & Proceedings of the 13th International DAAAM Symposium. Vienna, Austria: DAAAM International Vienna, 2002. 344 p. ISBN: 3/901509-29-1.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT10558,
author="Vlastimil {Martinek} and Jiří {Dvořák}",
title="Solving a Capacitated Dynamic Lot Sizing Problem",
booktitle="In Annals of DAAAM for 2002 & Proceedings of the 13th International DAAAM Symposium",
year="2002",
pages="344",
publisher="DAAAM International Vienna",
address="Vienna, Austria",
isbn="3/901509-29-1"
}
[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] => Solving a Capacitated Dynamic Lot Sizing Problem
[popis_en] => This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holding costs over the planning horizon. We propose a method for solving this problem based on genetic algorithms
[klicova_slova_en] => dynamic lot sizing, general product structure, multiple constrained resources, genetic algorithms
[vysledek_datum] => 2002-10-01T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 10563
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 31556
[vysledek_rok] => 2002
[nazev] => Plánování dráhy robota ve scéně s překážkami
[nazev_orig] => Plánování dráhy robota ve scéně s překážkami
[duvernost_udaju_id] => S
[popis] => V příspěvku se zabýváme hledáním optimální trajektorie mezi dvěma body v rovině obsahující statické překážky. Tato úloha má řadu průmyslových aplikací, např. v plánování dráhy robota. Studujeme dva odlišné přístupy založené na grafech viditelnosti, resp. Voronoiových diagramech a diskutujeme jejich použitelnost
[popis_orig] => V příspěvku se zabýváme hledáním optimální trajektorie mezi dvěma body v rovině obsahující statické překážky. Tato úloha má řadu průmyslových aplikací, např. v plánování dráhy robota. Studujeme dva odlišné přístupy založené na grafech viditelnosti, resp. Voronoiových diagramech a diskutujeme jejich použitelnost
[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] => Š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-248-0184-1
[identifikator_popis] => ISBN - Sborník z 11. semináře Moderní matematické metody v inženýrství 3mi
[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. Plánování dráhy robota ve scéně s překážkami. In Sborník z 11. semináře Moderní matematické metody v inženýrství 3mi. Ostrava: VŠB-TU Ostrava, 2002. 5 s. ISBN: 80-248-0184-1.
[citace_html] => ŠEDA, M. Plánování dráhy robota ve scéně s překážkami. In Sborník z 11. semináře Moderní matematické metody v inženýrství 3mi. Ostrava: VŠB-TU Ostrava, 2002. 5 s. ISBN: 80-248-0184-1.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT10563,
author="Miloš {Šeda}",
title="Plánování dráhy robota ve scéně s překážkami",
booktitle="Sborník z 11. semináře Moderní matematické metody v inženýrství 3mi",
year="2002",
pages="5",
publisher="VŠB-TU Ostrava",
address="Ostrava",
isbn="80-248-0184-1"
}
[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] => Robot motion planning in the plane with obstacles
[popis_en] => In this paper, finding the optimal trajectory between two given points in the plane, containing static obstacles, is studied. This task has a variety of industrial applications, e.g. in robot motion planning. We study two different approaches based on visibility graphs and Voronoi diagrams, respectivley, and discuss their applicability
[klicova_slova_en] => computational geometry, visibility graph, Voronoi diagram
[vysledek_datum] => 2002-06-01T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 10701
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 34684
[vysledek_rok] => 2002
[nazev] => Complex Evolutionary Algorithms
[nazev_orig] => Complex Evolutionary Algorithms
[duvernost_udaju_id] => S
[popis] => Evolutionary algorithms are applied to solve the dynamic scheduling problems
[popis_orig] => Evolutionary algorithms are applied to solve the dynamic scheduling problems
[klicova_slova] => complex evolutionary structures, adaptive systems
[klicova_slova_orig] => complex evolutionary structures, adaptive systems
[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] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => OŠMERA, P.
[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 3-98080889-2-0
[identifikator_popis] => ISBN - Proceedings East Weat Fuzzy Colloquium 2002
[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] => OŠMERA, P. Complex Evolutionary Algorithms. In Proceedings East Weat Fuzzy Colloquium 2002. Heft 75-2002. Zittau: Institut fur Processtechnik und Messtechnik (IPM), 2002. 10 p. ISBN: 3-98080889-2-0.
[citace_html] => OŠMERA, P. Complex Evolutionary Algorithms. In Proceedings East Weat Fuzzy Colloquium 2002. Heft 75-2002. Zittau: Institut fur Processtechnik und Messtechnik (IPM), 2002. 10 p. ISBN: 3-98080889-2-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT10701,
author="Pavel {Ošmera}",
title="Complex Evolutionary Algorithms",
booktitle="Proceedings East Weat Fuzzy Colloquium 2002",
year="2002",
series="Heft 75-2002",
number="první",
pages="10",
publisher="Institut fur Processtechnik und Messtechnik (IPM)",
address="Zittau",
isbn="3-98080889-2-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] => Complex Evolutionary Algorithms
[popis_en] => Evolutionary algorithms are applied to solve the dynamic scheduling problems
[klicova_slova_en] => complex evolutionary structures, adaptive systems
[vysledek_datum] => 2002-01-01T00:00:00+01:00
)
[6] => Array
(
[vysledek_id] => 10704
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 34688
[vysledek_rok] => 2002
[nazev] => Complex Evolutionary Algorithms
[nazev_orig] => Complex Evolutionary Algorithms
[duvernost_udaju_id] => S
[popis] => In this papper the complex evolutionary structures is described.
[popis_orig] => In this papper the complex evolutionary structures is described.
[klicova_slova] => Evolutionary algorithms, adaptive systems
[klicova_slova_orig] => Evolutionary algorithms, adaptive systems
[url] => http://www.RASC2002.info
[oecd_obor_id] =>
[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] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => OŠMERA, P., LACKO, B., MATOUŠEK, R.
[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 1-84233-0764
[identifikator_popis] => ISBN - Recent Advances in 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] => OŠMERA, P., LACKO, B., MATOUŠEK, R. Complex Evolutionary Algorithms. In Recent Advances in Soft Computing. RASC 2002. Nottingham: The Nottingham Trent University, 2002. 2 p. ISBN: 1-84233-0764.
[citace_html] => OŠMERA, P., LACKO, B., MATOUŠEK, R. Complex Evolutionary Algorithms. In Recent Advances in Soft Computing. RASC 2002. Nottingham: The Nottingham Trent University, 2002. 2 p. ISBN: 1-84233-0764.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT10704,
author="Pavel {Ošmera} and Branislav {Lacko} and Radomil {Matoušek}",
title="Complex Evolutionary Algorithms",
booktitle="Recent Advances in Soft Computing",
year="2002",
series="RASC 2002",
number="první",
pages="2",
publisher="The Nottingham Trent University",
address="Nottingham",
isbn="1-84233-0764",
url="http://www.RASC2002.info"
}
[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] =>
[oecd_tree_oblast_nazev] =>
[oecd_tree_obor_id] =>
[oecd_tree_obor_nazev] =>
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => Complex Evolutionary Algorithms
[popis_en] => In this papper the complex evolutionary structures is described.
[klicova_slova_en] => Evolutionary algorithms, adaptive systems
[vysledek_datum] => 2002-01-01T00:00:00+01:00
)
[7] => Array
(
[vysledek_id] => 10707
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 34692
[vysledek_rok] => 2002
[nazev] => Complex Evolutionary Structures
[nazev_orig] => Complex Evolutionary Structures
[duvernost_udaju_id] => S
[popis] => The emergent properties of complex adaptive systems are presented.
[popis_orig] => The emergent properties of complex adaptive systems are presented.
[klicova_slova] => adaptive systems, parallel genetic algorithms
[klicova_slova_orig] => adaptive systems, parallel genetic algorithms
[url] => knihovna VUT
[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] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => OŠMERA, P.
[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-2135-5
[identifikator_popis] => ISBN - MENDEL 2002
[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] => OŠMERA, P. Complex Evolutionary Structures. In MENDEL 2002. 8th Intrnational Conference on Soft Computing. Brno: Brno University of Technology, 2002. 8 p. ISBN: 80-214-2135-5.
[citace_html] => OŠMERA, P. Complex Evolutionary Structures. In MENDEL 2002. 8th Intrnational Conference on Soft Computing. Brno: Brno University of Technology, 2002. 8 p. ISBN: 80-214-2135-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT10707,
author="Pavel {Ošmera}",
title="Complex Evolutionary Structures",
booktitle="MENDEL 2002",
year="2002",
series="8th Intrnational Conference on Soft Computing",
number="prbní",
pages="8",
publisher="Brno University of Technology",
address="Brno",
isbn="80-214-2135-5",
url="knihovna VUT"
}
[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] => Complex Evolutionary Structures
[popis_en] => The emergent properties of complex adaptive systems are presented.
[klicova_slova_en] => adaptive systems, parallel genetic algorithms
[vysledek_datum] => 2002-01-01T00:00:00+01:00
)
)
)
Array
(
[total] => 2086
[page] => 22
[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] => DVOŘÁK, J., MAJER, P.
[title] => Fuzzy Job Shop Scheduling
[typ] => PV
[year] => 2002
[id_vav] => 10555
)
[1] => Array
(
[quotations] => DVOŘÁK, J., MARTINEK, V., KRÁL, J.
[title] => Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem
[typ] => PV
[year] => 2002
[id_vav] => 10556
)
[2] => Array
(
[quotations] => MAJER, P., DVOŘÁK, J.
[title] => Modeling Job Shop Scheduling Problem for Real-Life Conditions
[typ] => PV
[year] => 2002
[id_vav] => 10557
)
[3] => Array
(
[quotations] => MARTINEK, V., DVOŘÁK, J.
[title] => Solving a Capacitated Dynamic Lot Sizing Problem
[typ] => PV
[year] => 2002
[id_vav] => 10558
)
[4] => Array
(
[quotations] => ŠEDA, M.
[title] => Plánování dráhy robota ve scéně s překážkami
[typ] => PV
[year] => 2002
[id_vav] => 10563
)
[5] => Array
(
[quotations] => OŠMERA, P.
[title] => Complex Evolutionary Algorithms
[typ] => PV
[year] => 2002
[id_vav] => 10701
)
[6] => Array
(
[quotations] => OŠMERA, P., LACKO, B., MATOUŠEK, R.
[title] => Complex Evolutionary Algorithms
[typ] => PV
[year] => 2002
[id_vav] => 10704
)
[7] => Array
(
[quotations] => OŠMERA, P.
[title] => Complex Evolutionary Structures
[typ] => PV
[year] => 2002
[id_vav] => 10707
)
)
)
Publikace Rok: 2002
DVOŘÁK, J., MARTINEK, V., KRÁL, J.
Publikace Rok: 2002
MAJER, P., DVOŘÁK, J.
Zobrazeny výsledky 316–330 z 2086