Complex scheduling:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
| Ausgabe: | 2. ed. |
| Schriftenreihe: | GOR publications
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | Literaturverz.: S. 319 - 333 |
| Beschreibung: | X, 340 S. graph. Darst. 25 cm |
| ISBN: | 9783642239281 3642239285 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV039734384 | ||
| 003 | DE-604 | ||
| 005 | 20140604 | ||
| 007 | t | ||
| 008 | 111130s2012 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 1014250331 |2 DE-101 | |
| 020 | |a 9783642239281 |9 978-3-642-23928-1 | ||
| 020 | |a 3642239285 |9 3-642-23928-5 | ||
| 035 | |a (OCoLC)759534266 | ||
| 035 | |a (DE-599)DNB1014250331 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-83 |a DE-188 |a DE-11 |a DE-384 |a DE-92 | ||
| 082 | 0 | |a 658.4033 |2 22/ger | |
| 084 | |a QH 465 |0 (DE-625)141600: |2 rvk | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 90B35 |2 msc | ||
| 084 | |a 650 |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 Complex scheduling |c Peter Brucker ; Sigrid Knust |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
| 300 | |a X, 340 S. |b graph. Darst. |c 25 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a GOR publications | |
| 500 | |a Literaturverz.: S. 319 - 333 | ||
| 650 | 0 | 7 | |a Diskrete Optimierung |0 (DE-588)4150179-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 0 | 1 | |a Diskrete Optimierung |0 (DE-588)4150179-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Knust, Sigrid |e Verfasser |0 (DE-588)121614263 |4 aut | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3866367&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024582194&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024582194 | |
Datensatz im Suchindex
| _version_ | 1805145653480783872 |
|---|---|
| adam_text |
IMAGE 1
CONTENTS
PREFACE V
1 SCHEDULING MODELS 1
1.1 THE RCPSP AND SOME GENERALIZATIONS 1
1.2 MACHINE SCHEDULING 14
1.2.1 SINGLE-MACHINE SCHEDULING 14
1.2.2 PARALLEL MACHINE SCHEDULING 14
1.2.3 SHOP SCHEDULING 15
1.2.4 MULTI-PROCESSOR TASK SCHEDULING 17
1.3 APPLICATIONS OF THE RCPSP 18
1.4 REFERENCE NOTES 28
2 ALGORITHMS AND COMPLEXITY 29
2.1 EASY AND HARD PROBLEMS 29
2.1.1 POLYNOMIALLY SOLVABLE PROBLEMS 30
2.1.2 NP-HARD PROBLEMS 30
2.2 SHORTEST PATH ALGORITHMS 35
2.2.1 DIJKSTRA'S ALGORITHM 35
2.2.2 LABEL-CORRECTING ALGORITHMS 39
2.2.3 DETECTION OF NEGATIVE CYCLES 42
2.2.4 FLOYD-WARSHALL ALGORITHM 42
2.3 LINEAR PROGRAMMING 44
2.3.1 LINEAR PROGRAMS AND THE SIMPLEX ALGORITHM 44
2.3.2 DUALITY 52
2.3.3 THE REVISED SIMPLEX METHOD 56
2.3.4 DELAYED COLUMN GENERATION TECHNIQUES 58
2.4 LAGRANGIAN RELAXATION 62
VII
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1014250331
DIGITALISIERT DURCH
IMAGE 2
VIII CONTENTS
2.5 NETWORK FLOW ALGORITHMS 65
2.5.1 THE MINIMUM COST FLOW PROBLEM 65
2.5.2 THE RESIDUAL NETWORK AND DECOMPOSITION OF FLOWS . . . 67
2.5.3 THE MAXIMUM FLOW PROBLEM 72
2.5.4 FLOWS AND CUTS 73
2.5.5 ALGORITHMS FOR THE MAXIMUM FLOW PROBLEM 76
2.5.6 ALGORITHMS FOR THE MINIMUM COST FLOW PROBLEM 80
2.6 BRANCH-AND-BOUND ALGORITHMS 82
2.6.1 BASIC CONCEPTS 82
2.6.2 THE KNAPSACK PROBLEM 84
2.6.3 INTEGER LINEAR PROGRAMS 88
2.7 CONSTRAINT PROGRAMMING 91
2.8 THE SATISFIABILITY PROBLEM (SAT) 97
2.9 DYNAMIC PROGRAMMING 100
2.10 HEURISTIC METHODS 103
2.10.1 LOCAL SEARCH ALGORITHMS 103
2.10.2 GENETIC ALGORITHMS 110
2.10.3 ANT COLONY OPTIMIZATION 113
2.11 REFERENCE NOTES 115
3 RESOURCE-CONSTRAINED PROJECT SCHEDULING 117
3.1 BASICS 117
3.1.1 TEMPORAL ANALYSIS 117
3.1.2 A CLASSIFICATION OF SCHEDULES 119
3.1.3 REFERENCE NOTES 121
3.2 HEURISTIC METHODS 122
3.2.1 SCHEDULE GENERATION SCHEMES 122
3.2.2 PRIORITY-BASED HEURISTICS 128
3.2.3 LOCAL SEARCH ALGORITHMS 130
3.2.4 GENETIC ALGORITHMS 132
3.2.5 ANT COLONY OPTIMIZATION 136
3.2.6 HEURISTICS FOR THE MULTI-MODE CASE 137
3.2.7 REFERENCE NOTES 137
3.3 MIP FORMULATIONS OF THE RCPSP 138
IMAGE 3
CONTENTS IX
3.3.1 DISCRETE TIME FORMULATIONS 138
3.3.2 CONTINUOUS TIME FORMULATIONS 140
3.3.3 EVENT-BASED FORMULATIONS 142
3.3.4 PROJECT SCHEDULING WITH LABOR CONSTRAINTS 148
3.3.5 REFERENCE NOTES 150
3.4 A SAT FORMULATION OF THE RCPSP 150
3.5 GENERAL OBJECTIVE FUNCTIONS FOR PROBLEMS WITHOUT
RESOURCE CONSTRAINTS 151
3.5.1 REGULAR FUNCTIONS 152
3.5.2 LINEAR FUNCTIONS 152
3.5.3 CONVEX PIECEWISE LINEAR FUNCTIONS 154
3.5.4 GENERAL SUM FUNCTIONS 157
3.5.5 REFERENCE NOTES 161
3.6 CONSTRAINT PROPAGATION 162
3.6.1 BASIC RELATIONS 162
3.6.2 START-START DISTANCE MATRIX 163
3.6.3 SYMMETRIC TRIPLES AND EXTENSIONS 165
3.6.4 DISJUNCTIVE SETS 168
3.6.5 CUMULATIVE RESOURCES 186
3.6.6 CONSTRAINT PROPAGATION FOR THE MULTI-MODE CASE 186
3.6.7 REFERENCE NOTES 192
3.7 LOWER BOUNDS 193
3.7.1 COMBINATORIAL CONSTRUCTIVE LOWER BOUNDS 194
3.7.2 LOWER BOUNDS BASED ON LAGRANGIAN RELAXATION 196
3.7.3 AN LP-BASED CONSTRUCTIVE LOWER BOUND 197
3.7.4 AN LP-BASED DESTRUCTIVE METHOD 203
3.7.5 A DESTRUCTIVE METHOD FOR THE MULTI-MODE CASE 211
3.7.6 REFERENCE NOTES 216
3.8 BRANCH-AND-BOUND ALGORITHMS 217
3.8.1 AN ALGORITHM BASED ON PRECEDENCE TREES 217
3.8.2 AN ALGORITHM BASED ON EXTENSION ALTERNATIVES 221
3.8.3 AN ALGORITHM BASED ON DELAYING ALTERNATIVES 225
3.8.4 AN ALGORITHM BASED ON SCHEDULE SCHEMES 231
3.8.5 ALGORITHMS FOR THE MULTI-MODE CASE 237
3.8.6 REFERENCE NOTES 238
IMAGE 4
X CONTENTS
4 COMPLEX JOB-SHOP SCHEDULING 239
4.1 THE JOB-SHOP PROBLEM 239
4.1.1 PROBLEM FORMULATION 239
4.1.2 THE DISJUNCTIVE GRAPH MODEL 240
4.2 HEURISTIC METHODS 244
4.3 BRANCH-AND-BOUND ALGORITHMS 252
4.4 GENERALIZATIONS 253
4.5 JOB-SHOP PROBLEMS WITH FLEXIBLE MACHINES 259
4.5.1 PROBLEM FORMULATION 259
4.5.2 HEURISTIC METHODS 260
4.6 JOB-SHOP PROBLEMS WITH TRANSPORT ROBOTS 267
4.6.1 PROBLEM FORMULATION 267
4.6.2 PROBLEMS WITHOUT TRANSPORTATION CONFLICTS 268
4.6.3 PROBLEMS WITH TRANSPORTATION CONFLICTS 271
4.6.4 CONSTRAINT PROPAGATION 279
4.6.5 LOWER BOUNDS 285
4.6.6 HEURISTIC METHODS 296
4.7 JOB-SHOP PROBLEMS WITH LIMITED BUFFERS 300
4.7.1 PROBLEM FORMULATION 300
4.7.2 REPRESENTATION OF SOLUTIONS 301
4.7.3 FLOW-SHOP PROBLEMS WITH INTERMEDIATE BUFFERS 306
4.7.4 JOB-SHOP PROBLEMS WITH PAIRWISE BUFFERS 308
4.7.5 JOB-SHOP PROBLEMS WITH OUTPUT BUFFERS 308
4.7.6 JOB-SHOP PROBLEMS WITH INPUT BUFFERS 314
4.7.7 JOB-SHOP PROBLEMS WITH JOB-DEPENDENT BUFFERS 315
4.8 REFERENCE NOTES 316
BIBLIOGRAPHY 319
INDEX 335 |
| any_adam_object | 1 |
| author | Brucker, Peter 1942- Knust, Sigrid |
| author_GND | (DE-588)118176757 (DE-588)121614263 |
| author_facet | Brucker, Peter 1942- Knust, Sigrid |
| author_role | aut aut |
| author_sort | Brucker, Peter 1942- |
| author_variant | p b pb s k sk |
| building | Verbundindex |
| bvnumber | BV039734384 |
| classification_rvk | QH 465 SK 970 ST 134 |
| ctrlnum | (OCoLC)759534266 (DE-599)DNB1014250331 |
| dewey-full | 658.4033 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.4033 |
| dewey-search | 658.4033 |
| dewey-sort | 3658.4033 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Informatik Mathematik Wirtschaftswissenschaften |
| edition | 2. 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">BV039734384</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">111130s2012 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1014250331</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642239281</subfield><subfield code="9">978-3-642-23928-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642239285</subfield><subfield code="9">3-642-23928-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)759534266</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1014250331</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">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4033</subfield><subfield code="2">22/ger</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">ST 134</subfield><subfield code="0">(DE-625)143590:</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">90B35</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">650</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">Complex scheduling</subfield><subfield code="c">Peter Brucker ; Sigrid Knust</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 340 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">25 cm</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="0" ind2=" "><subfield code="a">GOR publications</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz.: S. 319 - 333</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskrete Optimierung</subfield><subfield code="0">(DE-588)4150179-2</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="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="1"><subfield code="a">Diskrete Optimierung</subfield><subfield code="0">(DE-588)4150179-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Knust, Sigrid</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121614263</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3866367&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=024582194&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024582194</subfield></datafield></record></collection> |
| id | DE-604.BV039734384 |
| illustrated | Illustrated |
| indexdate | 2024-07-21T00:17:25Z |
| institution | BVB |
| isbn | 9783642239281 3642239285 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024582194 |
| oclc_num | 759534266 |
| open_access_boolean | |
| owner | DE-83 DE-188 DE-11 DE-384 DE-92 |
| owner_facet | DE-83 DE-188 DE-11 DE-384 DE-92 |
| physical | X, 340 S. graph. Darst. 25 cm |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| series2 | GOR publications |
| spelling | Brucker, Peter 1942- Verfasser (DE-588)118176757 aut Complex scheduling Peter Brucker ; Sigrid Knust 2. ed. Berlin [u.a.] Springer 2012 X, 340 S. graph. Darst. 25 cm txt rdacontent n rdamedia nc rdacarrier GOR publications Literaturverz.: S. 319 - 333 Diskrete Optimierung (DE-588)4150179-2 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 s Diskrete Optimierung (DE-588)4150179-2 s DE-604 Knust, Sigrid Verfasser (DE-588)121614263 aut X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3866367&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024582194&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Brucker, Peter 1942- Knust, Sigrid Complex scheduling Diskrete Optimierung (DE-588)4150179-2 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd |
| subject_GND | (DE-588)4150179-2 (DE-588)4242167-6 |
| title | Complex scheduling |
| title_auth | Complex scheduling |
| title_exact_search | Complex scheduling |
| title_full | Complex scheduling Peter Brucker ; Sigrid Knust |
| title_fullStr | Complex scheduling Peter Brucker ; Sigrid Knust |
| title_full_unstemmed | Complex scheduling Peter Brucker ; Sigrid Knust |
| title_short | Complex scheduling |
| title_sort | complex scheduling |
| topic | Diskrete Optimierung (DE-588)4150179-2 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd |
| topic_facet | Diskrete Optimierung Reihenfolgeproblem |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3866367&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024582194&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bruckerpeter complexscheduling AT knustsigrid complexscheduling |