Scheduling algorithms: with 32 tables
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2004
|
| Ausgabe: | 4. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 343 - 361 |
| Beschreibung: | XII, 367 S. graph. Darst. |
| ISBN: | 3540205241 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019698611 | ||
| 003 | DE-604 | ||
| 005 | 20200904 | ||
| 007 | t | ||
| 008 | 050216s2004 gw d||| |||| 00||| eng d | ||
| 020 | |a 3540205241 |9 3-540-20524-1 | ||
| 035 | |a (OCoLC)314283672 | ||
| 035 | |a (DE-599)BVBBV019698611 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-20 |a DE-83 |a DE-11 |a DE-188 |a DE-862 | ||
| 082 | 0 | |a 658.53 | |
| 084 | |a QH 465 |0 (DE-625)141600: |2 rvk | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Brucker, Peter |d 1942- |e Verfasser |0 (DE-588)118176757 |4 aut | |
| 245 | 1 | 0 | |a Scheduling algorithms |b with 32 tables |c Peter Brucker |
| 250 | |a 4. ed. | ||
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2004 | |
| 300 | |a XII, 367 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 343 - 361 | ||
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |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)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 1 | |5 DE-188 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013026229&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Datensatz im Suchindex
| DE-BY-862_location | 2000 |
|---|---|
| DE-BY-FWS_call_number | 2000/SK 970 B888(4) |
| DE-BY-FWS_katkey | 237758 |
| DE-BY-FWS_media_number | 083000523901 |
| _version_ | 1806528276742537216 |
| adam_text |
Contents
1 Classification of Scheduling Problems 1
1.1 Scheduling Problems 1
1.2 Job Data 2
1.3 Job Characteristics 3
1.4 Machine Environment 5
1.5 Optimality Criteria 6
1.6 Examples 7
2 Some Problems in Combinatorial Optimization 11
2.1 Linear and Integer Programming 11
2.2 Transshipment Problems 12
2.3 The Maximum Flow Problem 13
2.4 Bipartite Matching Problems 14
2.5 The Assignment Problem 18
2.6 Arc Coloring of Bipartite Graphs 23
2.7 Shortest Path Problems and Dynamic Programming . 26
3 Computational Complexity 37
3.1 The Classes V and NV 37
3.2 A/""P complete and AfP hard Problems 41
3.3 Simple Reductions Between Scheduling Problems . 48
3.4 Living with AfP hard Problems 50
3.4.1 Local Search Techniques 51
3.4.2 Branch and Bound Algorithms 56
X CONTENTS
4 Single Machine Scheduling Problems 61
4.1 Minimax Criteria 62
4.1.1 Lawler's Algorithm for 1 | prec \ fmax 62
4.1.2 l\prec;pj = 1;rj | /max and 1 | prec\pmtn\rj | /max 63
4.2 Maximum Lateness and Related Criteria 67
4.3 Total Weighted Completion Time 73
4.3.1 1 | tree | Y.wjCj 73
4.3.2 1 | sp graph | YlwjCj 80
4.4 Weighted Number of Late Jobs 85
4.4.1 l|rj;Pj = l|E^^ 85
4.4.2 l\pj = l \J2wjUj 85
4.4.3 1 || ££/, 86
4.4.4 1 | rj pmtn \ T,wjUj 89
4.5 Total Weighted Tardiness 94
4.6 Problems with Release Times and Identical Processing
Times 98
4.6.1 1 | Tj\pj =p\ YlwjUj 98
4.6.2 1 | rj;Pj p | ^WjCj and 1 | rj;Pj = P | E^ ¦ • 102
4.7 Complexity of Single Machine Problems 104
5 Parallel Machines 107
5.1 Independent Jobs 107
5.1.1 Identical Machines 107
5.1.2 Uniform Machines 124
5.1.3 Unrelated Machines 136
5.2 Jobs with Precedence Constraints 139
5.2.1 P | tree; pi = 1 | Lmax Problems 139
5.2.2 Problem P2 | prec;pi = 1 | Lmax 145
5.3 Complexity Results 150
6 Shop Scheduling Problems 155
6.1 The Disjunctive Graph Model 156
6.2 Open Shop Problems 158
CONTENTS XI
6.2.1 Arbitrary Processing Times 158
6.2.2 Unit Processing Times 161
6.3 Flow Shop Problems 174
6.3.1 Minimizing Makespan 174
6.4 Job Shop Problems 178
6.4.1 Problems with Two Machines 179
6.4.2 Problems with Two Jobs. A Geometric Approach 187
6.4.3 Job Shop Problems with Two Machines 196
6.4.4 A Branch and Bound Algorithm 202
6.4.5 Applying Tabu Search to the Job Shop Problem . 221
6.5 Mixed Shop Problems 226
6.5.1 Problems with Two Machines 226
6.5.2 Problems with Two Jobs 227
6.6 Complexity of Shop Scheduling Problems 232
7 Due Date Scheduling 241
7.1 Problem \\dapt\ Ylwi\La(i)\ + ™o ¦ d 242
7.2 Problem lldoptlwBE^i+^rE^ + Wod 245
7.3 Problem 1 | d | £™i|4r(i)| 247
7.4 Problem 1 | d \ wE £ Et + wT £ T{ 253
7.5 Problem 1 | d \ \Li\max and 1 | d^ \ |Li|max 255
7.6 Problem l\d fpt\ Z t|£»| 257
7.7 Problem 1 | d \ X i|Li| 260
8 Batching Problems 265
8.1 Single Machine s Batching Problems 265
8.2 Single Machine p Batching Problems 269
8.2.1 The Unbounded Model 270
8.2.2 The Bounded Model 275
8.3 Complexity Results for Single Machine Batching Problems 275
9 Changeover Times and Transportation Times 279
9.1 Single Machine Problems 280
Xn CONTENTS
9.2 Problems with Parallel Machines 284
9.3 General Shop Problems 288
10 Multi Purpose Machines 289
10.1 MPM Problems with Identical and Uniform Machines . 290
10.2 MPM Problems with Shop Characteristics 296
10.2.1 Arbitrary Processing Times 296
10.2.2 Unit Processing Times 307
10.3 Complexity Results 311
11 Multiprocessor Tasks 313
11.1 Multiprocessor Task Systems 314
11.2 Shop Problems with MPT: Arbitrary Processing Times 319
11.3 Shop Problems with MPT: Unit Processing Times . 325
11.4 Multi Mode Multiprocessor Task Scheduling Problems . 331
11.5 Complexity Results 338
Bibliography 343
Index 363 |
| any_adam_object | 1 |
| author | Brucker, Peter 1942- |
| author_GND | (DE-588)118176757 |
| author_facet | Brucker, Peter 1942- |
| author_role | aut |
| author_sort | Brucker, Peter 1942- |
| author_variant | p b pb |
| building | Verbundindex |
| bvnumber | BV019698611 |
| classification_rvk | QH 465 SK 970 |
| ctrlnum | (OCoLC)314283672 (DE-599)BVBBV019698611 |
| dewey-full | 658.53 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.53 |
| dewey-search | 658.53 |
| dewey-sort | 3658.53 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Informatik Mathematik Wirtschaftswissenschaften |
| edition | 4. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV019698611</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200904</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050216s2004 gw d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540205241</subfield><subfield code="9">3-540-20524-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)314283672</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019698611</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-862</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.53</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 465</subfield><subfield code="0">(DE-625)141600:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brucker, Peter</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118176757</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling algorithms</subfield><subfield code="b">with 32 tables</subfield><subfield code="c">Peter Brucker</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 367 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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 343 - 361</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="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)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">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</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">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-188</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013026229&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV019698611 |
| illustrated | Illustrated |
| indexdate | 2024-08-05T08:33:39Z |
| institution | BVB |
| isbn | 3540205241 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013026229 |
| oclc_num | 314283672 |
| open_access_boolean | |
| owner | DE-20 DE-83 DE-11 DE-188 DE-862 DE-BY-FWS |
| owner_facet | DE-20 DE-83 DE-11 DE-188 DE-862 DE-BY-FWS |
| physical | XII, 367 S. graph. Darst. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Springer |
| record_format | marc |
| spellingShingle | Brucker, Peter 1942- Scheduling algorithms with 32 tables Reihenfolgeproblem (DE-588)4242167-6 gnd Scheduling (DE-588)4179449-7 gnd |
| subject_GND | (DE-588)4242167-6 (DE-588)4179449-7 (DE-588)4123623-3 |
| title | Scheduling algorithms with 32 tables |
| title_auth | Scheduling algorithms with 32 tables |
| title_exact_search | Scheduling algorithms with 32 tables |
| title_full | Scheduling algorithms with 32 tables Peter Brucker |
| title_fullStr | Scheduling algorithms with 32 tables Peter Brucker |
| title_full_unstemmed | Scheduling algorithms with 32 tables Peter Brucker |
| title_short | Scheduling algorithms |
| title_sort | scheduling algorithms with 32 tables |
| title_sub | with 32 tables |
| topic | Reihenfolgeproblem (DE-588)4242167-6 gnd Scheduling (DE-588)4179449-7 gnd |
| topic_facet | Reihenfolgeproblem Scheduling Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013026229&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bruckerpeter schedulingalgorithmswith32tables |
Inhaltsverzeichnis
THWS Schweinfurt Zentralbibliothek Lesesaal
| Signatur: |
2000 SK 970 B888(4) |
|---|---|
| Exemplar 1 | ausleihbar Verfügbar Bestellen |