A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Ann Arbor, Mich.
UMI, Diss., Information Service
1988
|
| Schlagworte: | |
| Beschreibung: | VII, 195 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021886704 | ||
| 003 | DE-604 | ||
| 005 | 20220210 | ||
| 007 | t | ||
| 008 | 891011s1988 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)634382212 | ||
| 035 | |a (DE-599)BVBBV021886704 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Stinson, Joel P. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| 264 | 1 | |a Ann Arbor, Mich. |b UMI, Diss., Information Service |c 1988 | |
| 300 | |a VII, 195 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Chapel Hill, Univ. of North Carolina, Diss., 1976 | ||
| 650 | 0 | 7 | |a Branch-and-Bound-Methode |0 (DE-588)4146449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Branch-and-Bound-Methode |0 (DE-588)4146449-7 |D s |
| 689 | 0 | 1 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015101951 | ||
Datensatz im Suchindex
| _version_ | 1804135828394344448 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Stinson, Joel P. |
| author_facet | Stinson, Joel P. |
| author_role | aut |
| author_sort | Stinson, Joel P. |
| author_variant | j p s jp jps |
| building | Verbundindex |
| bvnumber | BV021886704 |
| ctrlnum | (OCoLC)634382212 (DE-599)BVBBV021886704 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01260nam a2200349zc 4500</leader><controlfield tag="001">BV021886704</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220210 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">891011s1988 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634382212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021886704</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stinson, Joel P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ann Arbor, Mich.</subfield><subfield code="b">UMI, Diss., Information Service</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 195 Bl.</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="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Chapel Hill, Univ. of North Carolina, Diss., 1976</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</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="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</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">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015101951</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021886704 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:03:59Z |
| indexdate | 2024-07-09T20:46:42Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015101951 |
| oclc_num | 634382212 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | VII, 195 Bl. graph. Darst. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| publisher | UMI, Diss., Information Service |
| record_format | marc |
| spelling | Stinson, Joel P. Verfasser aut A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems Ann Arbor, Mich. UMI, Diss., Information Service 1988 VII, 195 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Zugl.: Chapel Hill, Univ. of North Carolina, Diss., 1976 Branch-and-Bound-Methode (DE-588)4146449-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Branch-and-Bound-Methode (DE-588)4146449-7 s Scheduling (DE-588)4179449-7 s Algorithmus (DE-588)4001183-5 s DE-604 |
| spellingShingle | Stinson, Joel P. A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems Branch-and-Bound-Methode (DE-588)4146449-7 gnd Algorithmus (DE-588)4001183-5 gnd Scheduling (DE-588)4179449-7 gnd |
| subject_GND | (DE-588)4146449-7 (DE-588)4001183-5 (DE-588)4179449-7 (DE-588)4113937-9 |
| title | A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| title_auth | A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| title_exact_search | A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| title_exact_search_txtP | A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| title_full | A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| title_fullStr | A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| title_full_unstemmed | A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| title_short | A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems |
| title_sort | a branch and bound algorithm for a general class of multiple resource constrained scheduling problems |
| topic | Branch-and-Bound-Methode (DE-588)4146449-7 gnd Algorithmus (DE-588)4001183-5 gnd Scheduling (DE-588)4179449-7 gnd |
| topic_facet | Branch-and-Bound-Methode Algorithmus Scheduling Hochschulschrift |
| work_keys_str_mv | AT stinsonjoelp abranchandboundalgorithmforageneralclassofmultipleresourceconstrainedschedulingproblems |