Scheduling Algorithms:
Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2001
|
| Ausgabe: | 3rd ed. 2001 |
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Zusammenfassung: | Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized. In the third edition of the book the complexity status of the different classes of scheduling problems is updated and corresponding references are added. New polynomial algorithms for single machine problems with release times and constant processing times are added |
| Beschreibung: | 1 Online-Ressource (XII, 365 p. 20 illus) |
| ISBN: | 9783662045503 |
| DOI: | 10.1007/978-3-662-04550-3 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046872881 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9783662045503 |9 978-3-662-04550-3 | ||
| 024 | 7 | |a 10.1007/978-3-662-04550-3 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-3-662-04550-3 | ||
| 035 | |a (OCoLC)903192240 | ||
| 035 | |a (DE-599)BVBBV046872881 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 658.40301 |2 23 | |
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 100 | 1 | |a Brucker, Peter |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Scheduling Algorithms |c by Peter Brucker |
| 250 | |a 3rd ed. 2001 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2001 | |
| 300 | |a 1 Online-Ressource (XII, 365 p. 20 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized. In the third edition of the book the complexity status of the different classes of scheduling problems is updated and corresponding references are added. New polynomial algorithms for single machine problems with release times and constant processing times are added | ||
| 650 | 4 | |a Operations Research/Decision Theory | |
| 650 | 4 | |a Calculus of Variations and Optimal Control; Optimization | |
| 650 | 4 | |a Computer Systems Organization and Communication Networks | |
| 650 | 4 | |a Complexity | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Decision making | |
| 650 | 4 | |a Calculus of variations | |
| 650 | 4 | |a Computer organization | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783662045527 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783662045510 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540415107 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-04550-3 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SBE |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SBE_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032283013 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-662-04550-3 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181722379583488 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Brucker, Peter |
| author_facet | Brucker, Peter |
| author_role | aut |
| author_sort | Brucker, Peter |
| author_variant | p b pb |
| building | Verbundindex |
| bvnumber | BV046872881 |
| classification_rvk | SK 970 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-3-662-04550-3 (OCoLC)903192240 (DE-599)BVBBV046872881 |
| dewey-full | 658.40301 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.40301 |
| dewey-search | 658.40301 |
| dewey-sort | 3658.40301 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-3-662-04550-3 |
| edition | 3rd ed. 2001 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02989nmm a2200601zc 4500</leader><controlfield tag="001">BV046872881</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662045503</subfield><subfield code="9">978-3-662-04550-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-04550-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-3-662-04550-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)903192240</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046872881</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.40301</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brucker, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling Algorithms</subfield><subfield code="c">by Peter Brucker</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3rd ed. 2001</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 365 p. 20 illus)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized. In the third edition of the book the complexity status of the different classes of scheduling problems is updated and corresponding references are added. New polynomial algorithms for single machine problems with release times and constant processing times are added</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus of Variations and Optimal Control; Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Systems Organization and Communication Networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus of variations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer organization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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="650" ind1="0" ind2="7"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</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">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783662045527</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783662045510</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540415107</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-04550-3</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SBE</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SBE_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032283013</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-04550-3</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SBE</subfield><subfield code="q">ZDB-2-SBE_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV046872881 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:38Z |
| indexdate | 2024-07-10T08:56:10Z |
| institution | BVB |
| isbn | 9783662045503 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032283013 |
| oclc_num | 903192240 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XII, 365 p. 20 illus) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| spelling | Brucker, Peter Verfasser aut Scheduling Algorithms by Peter Brucker 3rd ed. 2001 Berlin, Heidelberg Springer Berlin Heidelberg 2001 1 Online-Ressource (XII, 365 p. 20 illus) txt rdacontent c rdamedia cr rdacarrier Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized. In the third edition of the book the complexity status of the different classes of scheduling problems is updated and corresponding references are added. New polynomial algorithms for single machine problems with release times and constant processing times are added Operations Research/Decision Theory Calculus of Variations and Optimal Control; Optimization Computer Systems Organization and Communication Networks Complexity Operations research Decision making Calculus of variations Computer organization Computational complexity Scheduling (DE-588)4179449-7 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content Reihenfolgeproblem (DE-588)4242167-6 s DE-604 Scheduling (DE-588)4179449-7 s Erscheint auch als Druck-Ausgabe 9783662045527 Erscheint auch als Druck-Ausgabe 9783662045510 Erscheint auch als Druck-Ausgabe 9783540415107 https://doi.org/10.1007/978-3-662-04550-3 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Brucker, Peter Scheduling Algorithms Operations Research/Decision Theory Calculus of Variations and Optimal Control; Optimization Computer Systems Organization and Communication Networks Complexity Operations research Decision making Calculus of variations Computer organization Computational complexity Scheduling (DE-588)4179449-7 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd |
| subject_GND | (DE-588)4179449-7 (DE-588)4242167-6 (DE-588)4123623-3 |
| title | Scheduling Algorithms |
| title_auth | Scheduling Algorithms |
| title_exact_search | Scheduling Algorithms |
| title_exact_search_txtP | Scheduling Algorithms |
| title_full | Scheduling Algorithms by Peter Brucker |
| title_fullStr | Scheduling Algorithms by Peter Brucker |
| title_full_unstemmed | Scheduling Algorithms by Peter Brucker |
| title_short | Scheduling Algorithms |
| title_sort | scheduling algorithms |
| topic | Operations Research/Decision Theory Calculus of Variations and Optimal Control; Optimization Computer Systems Organization and Communication Networks Complexity Operations research Decision making Calculus of variations Computer organization Computational complexity Scheduling (DE-588)4179449-7 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd |
| topic_facet | Operations Research/Decision Theory Calculus of Variations and Optimal Control; Optimization Computer Systems Organization and Communication Networks Complexity Operations research Decision making Calculus of variations Computer organization Computational complexity Scheduling Reihenfolgeproblem Lehrbuch |
| url | https://doi.org/10.1007/978-3-662-04550-3 |
| work_keys_str_mv | AT bruckerpeter schedulingalgorithms |