On polynomial solvability of two multiprocessor scheduling problems

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Girlich, Eberhard (VerfasserIn), Tarnovskij, Aleksandr G. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Magdeburg Otto-von-Guericke-Univ., Fak. für Mathematik 1997
Schriftenreihe:Universität <Magdeburg> / Fakultät für Mathematik: Preprint 1996,38
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 cb4500
001 BV011723009
003 DE-604
005 00000000000000.0
007 t|
008 980119s1997 xx d||| |||| 00||| eng d
035 |a (OCoLC)76005920 
035 |a (DE-599)BVBBV011723009 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
049 |a DE-29 
100 1 |a Girlich, Eberhard  |e Verfasser  |4 aut 
245 1 0 |a On polynomial solvability of two multiprocessor scheduling problems  |c Eberhard Girlich ; Alexander G. Tarnowski 
264 1 |a Magdeburg  |b Otto-von-Guericke-Univ., Fak. für Mathematik  |c 1997 
300 |a 25 S.  |b graph. Darst. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
490 1 |a Universität <Magdeburg> / Fakultät für Mathematik: Preprint  |v 1996,38 
700 1 |a Tarnovskij, Aleksandr G.  |e Verfasser  |4 aut 
810 2 |a Fakultät für Mathematik: Preprint  |t Universität <Magdeburg>  |v 1996,38  |w (DE-604)BV009892807  |9 1996,38 
943 1 |a oai:aleph.bib-bvb.de:BVB01-007906585 

Datensatz im Suchindex

_version_ 1819242371509911552
any_adam_object
author Girlich, Eberhard
Tarnovskij, Aleksandr G.
author_facet Girlich, Eberhard
Tarnovskij, Aleksandr G.
author_role aut
aut
author_sort Girlich, Eberhard
author_variant e g eg
a g t ag agt
building Verbundindex
bvnumber BV011723009
ctrlnum (OCoLC)76005920
(DE-599)BVBBV011723009
format Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01014nam a2200277 cb4500</leader><controlfield tag="001">BV011723009</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">980119s1997 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)76005920</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011723009</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Girlich, Eberhard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On polynomial solvability of two multiprocessor scheduling problems</subfield><subfield code="c">Eberhard Girlich ; Alexander G. Tarnowski</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Magdeburg</subfield><subfield code="b">Otto-von-Guericke-Univ., Fak. für Mathematik</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</subfield><subfield code="b">graph. Darst.</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">Universität &lt;Magdeburg&gt; / Fakultät für Mathematik: Preprint</subfield><subfield code="v">1996,38</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tarnovskij, Aleksandr G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik: Preprint</subfield><subfield code="t">Universität &lt;Magdeburg&gt;</subfield><subfield code="v">1996,38</subfield><subfield code="w">(DE-604)BV009892807</subfield><subfield code="9">1996,38</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007906585</subfield></datafield></record></collection>
id DE-604.BV011723009
illustrated Illustrated
indexdate 2024-12-23T14:38:44Z
institution BVB
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-007906585
oclc_num 76005920
open_access_boolean
owner DE-29
owner_facet DE-29
physical 25 S. graph. Darst.
publishDate 1997
publishDateSearch 1997
publishDateSort 1997
publisher Otto-von-Guericke-Univ., Fak. für Mathematik
record_format marc
series2 Universität <Magdeburg> / Fakultät für Mathematik: Preprint
spelling Girlich, Eberhard Verfasser aut
On polynomial solvability of two multiprocessor scheduling problems Eberhard Girlich ; Alexander G. Tarnowski
Magdeburg Otto-von-Guericke-Univ., Fak. für Mathematik 1997
25 S. graph. Darst.
txt rdacontent
n rdamedia
nc rdacarrier
Universität <Magdeburg> / Fakultät für Mathematik: Preprint 1996,38
Tarnovskij, Aleksandr G. Verfasser aut
Fakultät für Mathematik: Preprint Universität <Magdeburg> 1996,38 (DE-604)BV009892807 1996,38
spellingShingle Girlich, Eberhard
Tarnovskij, Aleksandr G.
On polynomial solvability of two multiprocessor scheduling problems
title On polynomial solvability of two multiprocessor scheduling problems
title_auth On polynomial solvability of two multiprocessor scheduling problems
title_exact_search On polynomial solvability of two multiprocessor scheduling problems
title_full On polynomial solvability of two multiprocessor scheduling problems Eberhard Girlich ; Alexander G. Tarnowski
title_fullStr On polynomial solvability of two multiprocessor scheduling problems Eberhard Girlich ; Alexander G. Tarnowski
title_full_unstemmed On polynomial solvability of two multiprocessor scheduling problems Eberhard Girlich ; Alexander G. Tarnowski
title_short On polynomial solvability of two multiprocessor scheduling problems
title_sort on polynomial solvability of two multiprocessor scheduling problems
volume_link (DE-604)BV009892807
work_keys_str_mv AT girlicheberhard onpolynomialsolvabilityoftwomultiprocessorschedulingproblems
AT tarnovskijaleksandrg onpolynomialsolvabilityoftwomultiprocessorschedulingproblems