Lower and upper bounds for on-line bin packing and scheduling heuristics: = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
Thesis Publ.
1995
|
| Schriftenreihe: | Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series
93 |
| Schlagworte: | |
| Beschreibung: | Zugl.: Rotterdam, Erasmus Univ., Diss., 1995 |
| Beschreibung: | 144 S. |
| ISBN: | 9051703279 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010076607 | ||
| 003 | DE-604 | ||
| 005 | 19950306 | ||
| 007 | t | ||
| 008 | 950303s1995 m||| 00||| eng d | ||
| 020 | |a 9051703279 |9 90-5170-327-9 | ||
| 035 | |a (OCoLC)34157599 | ||
| 035 | |a (DE-599)BVBBV010076607 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-19 | ||
| 100 | 1 | |a Vliet, André van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Lower and upper bounds for on-line bin packing and scheduling heuristics |b = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken |c door André van Vliet |
| 246 | 1 | 1 | |a Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken |
| 264 | 1 | |a Amsterdam |b Thesis Publ. |c 1995 | |
| 300 | |a 144 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series |v 93 | |
| 500 | |a Zugl.: Rotterdam, Erasmus Univ., Diss., 1995 | ||
| 650 | 7 | |a Wachttijdproblemen |2 gtt | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Production scheduling | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Packungsproblem |0 (DE-588)4173057-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Packungsproblem |0 (DE-588)4173057-4 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series |v 93 |w (DE-604)BV004252095 |9 93 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006687750 | ||
Datensatz im Suchindex
| _version_ | 1804124464608182272 |
|---|---|
| any_adam_object | |
| author | Vliet, André van |
| author_facet | Vliet, André van |
| author_role | aut |
| author_sort | Vliet, André van |
| author_variant | a v v av avv |
| building | Verbundindex |
| bvnumber | BV010076607 |
| ctrlnum | (OCoLC)34157599 (DE-599)BVBBV010076607 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01627nam a2200409 cb4500</leader><controlfield tag="001">BV010076607</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950306 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950303s1995 m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9051703279</subfield><subfield code="9">90-5170-327-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34157599</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010076607</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-19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vliet, André van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lower and upper bounds for on-line bin packing and scheduling heuristics</subfield><subfield code="b">= Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken</subfield><subfield code="c">door André van Vliet</subfield></datafield><datafield tag="246" ind1="1" ind2="1"><subfield code="a">Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">Thesis Publ.</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">144 S.</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">Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series</subfield><subfield code="v">93</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Rotterdam, Erasmus Univ., Diss., 1995</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Wachttijdproblemen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</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="650" ind1="0" ind2="7"><subfield code="a">Packungsproblem</subfield><subfield code="0">(DE-588)4173057-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Packungsproblem</subfield><subfield code="0">(DE-588)4173057-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="830" ind1=" " ind2="0"><subfield code="a">Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series</subfield><subfield code="v">93</subfield><subfield code="w">(DE-604)BV004252095</subfield><subfield code="9">93</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006687750</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010076607 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:46:05Z |
| institution | BVB |
| isbn | 9051703279 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006687750 |
| oclc_num | 34157599 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM |
| owner_facet | DE-19 DE-BY-UBM |
| physical | 144 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Thesis Publ. |
| record_format | marc |
| series | Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series |
| series2 | Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series |
| spelling | Vliet, André van Verfasser aut Lower and upper bounds for on-line bin packing and scheduling heuristics = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken door André van Vliet Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken Amsterdam Thesis Publ. 1995 144 S. txt rdacontent n rdamedia nc rdacarrier Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series 93 Zugl.: Rotterdam, Erasmus Univ., Diss., 1995 Wachttijdproblemen gtt Combinatorial optimization Production scheduling Algorithmus (DE-588)4001183-5 gnd rswk-swf Packungsproblem (DE-588)4173057-4 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Packungsproblem (DE-588)4173057-4 s Algorithmus (DE-588)4001183-5 s DE-604 Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series 93 (DE-604)BV004252095 93 |
| spellingShingle | Vliet, André van Lower and upper bounds for on-line bin packing and scheduling heuristics = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken Tinbergen Instituut <Amsterdam; Rotterdam>: Tinbergen Institute research series Wachttijdproblemen gtt Combinatorial optimization Production scheduling Algorithmus (DE-588)4001183-5 gnd Packungsproblem (DE-588)4173057-4 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4173057-4 (DE-588)4113937-9 |
| title | Lower and upper bounds for on-line bin packing and scheduling heuristics = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken |
| title_alt | Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken |
| title_auth | Lower and upper bounds for on-line bin packing and scheduling heuristics = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken |
| title_exact_search | Lower and upper bounds for on-line bin packing and scheduling heuristics = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken |
| title_full | Lower and upper bounds for on-line bin packing and scheduling heuristics = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken door André van Vliet |
| title_fullStr | Lower and upper bounds for on-line bin packing and scheduling heuristics = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken door André van Vliet |
| title_full_unstemmed | Lower and upper bounds for on-line bin packing and scheduling heuristics = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken door André van Vliet |
| title_short | Lower and upper bounds for on-line bin packing and scheduling heuristics |
| title_sort | lower and upper bounds for on line bin packing and scheduling heuristics onder en bovengrenzen voor on line bin packing en scheduling heuristieken |
| title_sub | = Onder- en bovengrenzen voor on-line bin packing en scheduling heuristieken |
| topic | Wachttijdproblemen gtt Combinatorial optimization Production scheduling Algorithmus (DE-588)4001183-5 gnd Packungsproblem (DE-588)4173057-4 gnd |
| topic_facet | Wachttijdproblemen Combinatorial optimization Production scheduling Algorithmus Packungsproblem Hochschulschrift |
| volume_link | (DE-604)BV004252095 |
| work_keys_str_mv | AT vlietandrevan lowerandupperboundsforonlinebinpackingandschedulingheuristicsonderenbovengrenzenvooronlinebinpackingenschedulingheuristieken AT vlietandrevan onderenbovengrenzenvooronlinebinpackingenschedulingheuristieken |