A simple proof for the "longest-job-first" policy in one-machine scheduling
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Kaiserslautern
1990
|
| Schriftenreihe: | Universität <Kaiserslautern> / Fachbereich Mathematik: Preprint
177 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004305210 | ||
| 003 | DE-604 | ||
| 005 | 20181009 | ||
| 007 | t | ||
| 008 | 910326s1990 |||| 00||| gerod | ||
| 035 | |a (OCoLC)46087649 | ||
| 035 | |a (DE-599)BVBBV004305210 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 |a DE-355 |a DE-29T |a DE-91G | ||
| 084 | |a SI 716 |0 (DE-625)143183: |2 rvk | ||
| 100 | 1 | |a Cheng, T. C. E. |e Verfasser |0 (DE-588)1047980339 |4 aut | |
| 245 | 1 | 0 | |a A simple proof for the "longest-job-first" policy in one-machine scheduling |c T. C. Edwin Cheng and Helmut G. Kahlbacher |
| 264 | 1 | |a Kaiserslautern |c 1990 | |
| 300 | |a 7 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Kaiserslautern> / Fachbereich Mathematik: Preprint |v 177 | |
| 700 | 1 | |a Kahlbacher, Helmut G. |e Verfasser |4 aut | |
| 810 | 2 | |a Fachbereich Mathematik: Preprint |t Universität <Kaiserslautern> |v 177 |w (DE-604)BV000003820 |9 177 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002677339 | ||
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111/2001 B 6056-177 |
|---|---|
| DE-BY-TUM_katkey | 727138 |
| DE-BY-TUM_media_number | 040010058256 |
| _version_ | 1816711725925269504 |
| any_adam_object | |
| author | Cheng, T. C. E. Kahlbacher, Helmut G. |
| author_GND | (DE-588)1047980339 |
| author_facet | Cheng, T. C. E. Kahlbacher, Helmut G. |
| author_role | aut aut |
| author_sort | Cheng, T. C. E. |
| author_variant | t c e c tce tcec h g k hg hgk |
| building | Verbundindex |
| bvnumber | BV004305210 |
| classification_rvk | SI 716 |
| ctrlnum | (OCoLC)46087649 (DE-599)BVBBV004305210 |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01045nam a2200289 cb4500</leader><controlfield tag="001">BV004305210</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20181009 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910326s1990 |||| 00||| gerod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46087649</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004305210</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">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 716</subfield><subfield code="0">(DE-625)143183:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cheng, T. C. E.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1047980339</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A simple proof for the "longest-job-first" policy in one-machine scheduling</subfield><subfield code="c">T. C. Edwin Cheng and Helmut G. Kahlbacher</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kaiserslautern</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 Bl.</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 <Kaiserslautern> / Fachbereich Mathematik: Preprint</subfield><subfield code="v">177</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kahlbacher, Helmut G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fachbereich Mathematik: Preprint</subfield><subfield code="t">Universität <Kaiserslautern></subfield><subfield code="v">177</subfield><subfield code="w">(DE-604)BV000003820</subfield><subfield code="9">177</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002677339</subfield></datafield></record></collection> |
| id | DE-604.BV004305210 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-25T17:14:19Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002677339 |
| oclc_num | 46087649 |
| open_access_boolean | |
| owner | DE-12 DE-355 DE-BY-UBR DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-355 DE-BY-UBR DE-29T DE-91G DE-BY-TUM |
| physical | 7 Bl. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Universität <Kaiserslautern> / Fachbereich Mathematik: Preprint |
| spellingShingle | Cheng, T. C. E. Kahlbacher, Helmut G. A simple proof for the "longest-job-first" policy in one-machine scheduling |
| title | A simple proof for the "longest-job-first" policy in one-machine scheduling |
| title_auth | A simple proof for the "longest-job-first" policy in one-machine scheduling |
| title_exact_search | A simple proof for the "longest-job-first" policy in one-machine scheduling |
| title_full | A simple proof for the "longest-job-first" policy in one-machine scheduling T. C. Edwin Cheng and Helmut G. Kahlbacher |
| title_fullStr | A simple proof for the "longest-job-first" policy in one-machine scheduling T. C. Edwin Cheng and Helmut G. Kahlbacher |
| title_full_unstemmed | A simple proof for the "longest-job-first" policy in one-machine scheduling T. C. Edwin Cheng and Helmut G. Kahlbacher |
| title_short | A simple proof for the "longest-job-first" policy in one-machine scheduling |
| title_sort | a simple proof for the longest job first policy in one machine scheduling |
| volume_link | (DE-604)BV000003820 |
| work_keys_str_mv | AT chengtce asimpleproofforthelongestjobfirstpolicyinonemachinescheduling AT kahlbacherhelmutg asimpleproofforthelongestjobfirstpolicyinonemachinescheduling |