Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | Undetermined |
Veröffentlicht: |
Dortmund
Univ. Dortmund
1981
|
Schriftenreihe: | Forschungsbericht / Abteilung Informatik, Universität Dortmund
124 |
Schlagworte: | |
Beschreibung: | Getr. Zählung |
Internformat
MARC
LEADER | 00000nam a2200000zcb4500 | ||
---|---|---|---|
001 | BV022187431 | ||
003 | DE-604 | ||
005 | 20040301000000.0 | ||
007 | t | ||
008 | 951204s1981 |||| 00||| und d | ||
035 | |a (OCoLC)630756000 | ||
035 | |a (DE-599)BVBBV022187431 | ||
040 | |a DE-604 |b ger | ||
041 | |a und | ||
049 | |a DE-706 | ||
084 | |a SS 5530 |0 (DE-625)143553: |2 rvk | ||
100 | 1 | |a Beilner, Heinz |e Verfasser |4 aut | |
245 | 1 | 0 | |a Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis |c H. Beilner |
264 | 1 | |a Dortmund |b Univ. Dortmund |c 1981 | |
300 | |a Getr. Zählung | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Forschungsbericht / Abteilung Informatik, Universität Dortmund |v 124 | |
650 | 0 | 7 | |a Warteschlangennetz |0 (DE-588)4225823-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Warteschlangennetz |0 (DE-588)4225823-6 |D s |
689 | 1 | |5 DE-604 | |
810 | 2 | |a Abteilung Informatik, Universität Dortmund |t Forschungsbericht |v 124 |w (DE-604)BV004082873 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015402210 |
Datensatz im Suchindex
_version_ | 1804136163203612672 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Beilner, Heinz |
author_facet | Beilner, Heinz |
author_role | aut |
author_sort | Beilner, Heinz |
author_variant | h b hb |
building | Verbundindex |
bvnumber | BV022187431 |
classification_rvk | SS 5530 |
ctrlnum | (OCoLC)630756000 (DE-599)BVBBV022187431 |
discipline | Informatik |
discipline_str_mv | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01252nam a2200349zcb4500</leader><controlfield tag="001">BV022187431</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951204s1981 |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)630756000</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022187431</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5530</subfield><subfield code="0">(DE-625)143553:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beilner, Heinz</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis</subfield><subfield code="c">H. Beilner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dortmund</subfield><subfield code="b">Univ. Dortmund</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Getr. Zählung</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Forschungsbericht / Abteilung Informatik, Universität Dortmund</subfield><subfield code="v">124</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Abteilung Informatik, Universität Dortmund</subfield><subfield code="t">Forschungsbericht</subfield><subfield code="v">124</subfield><subfield code="w">(DE-604)BV004082873</subfield><subfield code="9"></subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015402210</subfield></datafield></record></collection> |
id | DE-604.BV022187431 |
illustrated | Not Illustrated |
index_date | 2024-07-02T16:21:04Z |
indexdate | 2024-07-09T20:52:02Z |
institution | BVB |
language | Undetermined |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015402210 |
oclc_num | 630756000 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | Getr. Zählung |
publishDate | 1981 |
publishDateSearch | 1981 |
publishDateSort | 1981 |
publisher | Univ. Dortmund |
record_format | marc |
series2 | Forschungsbericht / Abteilung Informatik, Universität Dortmund |
spelling | Beilner, Heinz Verfasser aut Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis H. Beilner Dortmund Univ. Dortmund 1981 Getr. Zählung txt rdacontent n rdamedia nc rdacarrier Forschungsbericht / Abteilung Informatik, Universität Dortmund 124 Warteschlangennetz (DE-588)4225823-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Warteschlangennetz (DE-588)4225823-6 s Abteilung Informatik, Universität Dortmund Forschungsbericht 124 (DE-604)BV004082873 |
spellingShingle | Beilner, Heinz Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis Warteschlangennetz (DE-588)4225823-6 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4225823-6 (DE-588)4001183-5 |
title | Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis |
title_auth | Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis |
title_exact_search | Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis |
title_exact_search_txtP | Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis |
title_full | Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis H. Beilner |
title_fullStr | Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis H. Beilner |
title_full_unstemmed | Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis H. Beilner |
title_short | Algorithms for evaluating separable, mixed, state-independet queuing networks or improving, slightly, on mean value analysis |
title_sort | algorithms for evaluating separable mixed state independet queuing networks or improving slightly on mean value analysis |
topic | Warteschlangennetz (DE-588)4225823-6 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Warteschlangennetz Algorithmus |
volume_link | (DE-604)BV004082873 |
work_keys_str_mv | AT beilnerheinz algorithmsforevaluatingseparablemixedstateindependetqueuingnetworksorimprovingslightlyonmeanvalueanalysis |