Scheduling: theory, algorithms, and systems
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York [u.a.]
Springer
2012
|
| Ausgabe: | 4. edition |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Extras: extras.springer.com |
| Beschreibung: | XX, 673 Seiten Ill., graph. Darst. 24 cm |
| ISBN: | 9781461419860 1461419867 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV039886454 | ||
| 003 | DE-604 | ||
| 005 | 20170828 | ||
| 007 | t | ||
| 008 | 120214s2012 ad|| |||| 00||| eng d | ||
| 020 | |a 9781461419860 |c (hbk.) |9 978-1-4614-1986-0 | ||
| 020 | |a 1461419867 |c (hbk.) |9 1-461-41986-7 | ||
| 035 | |a (OCoLC)767957489 | ||
| 035 | |a (DE-599)BSZ35376583X | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 |a DE-945 |a DE-2070s |a DE-20 |a DE-83 |a DE-19 |a DE-384 |a DE-739 |a DE-188 | ||
| 082 | 0 | |a 658.53 | |
| 084 | |a QH 465 |0 (DE-625)141600: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 100 | 1 | |a Pinedo, Michael |d 1950- |e Verfasser |0 (DE-588)1042304629 |4 aut | |
| 245 | 1 | 0 | |a Scheduling |b theory, algorithms, and systems |c Michael L. Pinedo |
| 250 | |a 4. edition | ||
| 264 | 1 | |a New York [u.a.] |b Springer |c 2012 | |
| 300 | |a XX, 673 Seiten |b Ill., graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Extras: extras.springer.com | ||
| 650 | 0 | 7 | |a Produktionsplanung |0 (DE-588)4047360-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Operations Research |0 (DE-588)4043586-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Systemtheorie |0 (DE-588)4058812-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Betriebsplanung |0 (DE-588)4006197-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 653 | |a Production scheduling | ||
| 655 | 7 | |8 1\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Produktionsplanung |0 (DE-588)4047360-0 |D s |
| 689 | 0 | 1 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | 3 | |a Systemtheorie |0 (DE-588)4058812-9 |D s |
| 689 | 0 | 4 | |a Operations Research |0 (DE-588)4043586-6 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 689 | 1 | 0 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 1 | |8 3\p |5 DE-604 | |
| 689 | 2 | 0 | |a Betriebsplanung |0 (DE-588)4006197-8 |D s |
| 689 | 2 | |8 4\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |a Pinedo, Michael |t Scheduling |n Online-Ausgabe |z 978-1-4614-2361-4 |
| 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=024745570&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024745570 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804148833274298368 |
|---|---|
| adam_text | Titel: Scheduling
Autor: Pinedo, Michael
Jahr: 2012
Contents
Preface......................................................... vii
Supplementary Electronic Material............................. xix
1 Introduction................................................ 1
1.1 The Role of Scheduling.................................... 1
1.2 The Scheduling Function in an Enterprise................... 4
1.3 Outline of the Book....................................... 6
Part I Deterministic Models
2 Deterministic Models: Preliminaries........................ 13
2.1 Framework and Notation.................................. 13
2.2 Examples................................................ 20
2.3 Classes of Schedules ...................................... 21
2.4 Complexity Hierarchy..................................... 26
3 Single Machine Models (Deterministic)..................... 35
3.1 The Total Weighted Completion Time...................... 36
3.2 The Maximum Lateness................................... 42
3.3 The Number of Tardy Jobs................................ 47
3.4 The Total Tardiness - Dynamic Programming................ 50
3.5 The Total Tardiness - An Approximation Scheme............. 54
3.6 The Total Weighted Tardiness ............................. 57
3.7 Discussion............................................... 61
4 Advanced Single Machine Models (Deterministic) .......... 69
4.1 The Total Earliness and Tardiness.......................... 70
4.2 Primary and Secondary Objectives ......................... 77
4.3 Multiple Objectives: A Parametric Analysis.................. 79
4.4 The Makespan with Sequence Dependent Setup Times........ 82
4.5 Job Families with Setup Times............................. 91
4.6 Batch Processing......................................... 98
4.7 Discussion............................................... 104
5 Parallel Machine Models (Deterministic) .................111
5.1 The Makespan without Preemptions........................112
5.2 The Makespan with Preemptions...........................122
5.3 The Total Completion Time without Preemptions............129
5.4 The Total Completion Time with Preemptions...............133
5.5 Due Date Related Objectives ..............................136
5.6 Online Scheduling........................................137
5.7 Discussion...............................................142
6 Flow Shops and Flexible Flow Shops (Deterministic) .......151
6.1 Flow Shops with Unlimited Intermediate Storage.............152
6.2 Flow Shops with Limited Intermediate Storage...............161
6.3 Proportionate Flow Shops with Unlimited and Limited
Intermediate Storage......................................167
6.4 Flexible Flow Shops with Unlimited Intermediate Storage.....174
6.5 Discussion...............................................176
7 Job Shops (Deterministic)..................................183
7.1 Disjunctive Programming and Branch-and-Bound ............183
7.2 The Shifting Bottleneck Heuristic and the Makespan.......... 193
7.3 The Shifting Bottleneck Heuristic and the Total Weighted
Tardiness................................................201
7.4 Constraint Programming and the Makespan .................207
7.5 Discussion...............................................215
8 Open Shops (Deterministic) ................................221
8.1 The Makespan without Preemptions........................221
8.2 The Makespan with Preemptions...........................225
8.3 The Maximum Lateness without Preemptions................228
8.4 The Maximum Lateness with Preemptions...................233
8.5 The Number of Tardy Jobs................................237
8.6 Discussion...............................................238
Part II Stochastic Models
9 Stochastic Models: Preliminaries ...........................247
9.1 Framework and Notation..................................247
9.2 Distributions and Classes of Distributions ...................248
9.3 Stochastic Dominance.....................................252
9.4 Impact of Randomness on Fixed Schedules...................255
9.5 Classes of Policies........................................259
10 Single Machine Models (Stochastic) ........................267
10.1 Arbitrary Distributions without Preemptions ................267
10.2 Arbitrary Distributions with Preemptions: the Gittins Index . . . 274
10.3 Likelihood Ratio Ordered Distributions .....................279
10.4 Exponential Distributions.................................282
10.5 Discussion...............................................289
11 Single Machine Models with Release Dates (Stochastic) .... 295
11.1 Arbitrary Release Dates and Arbitrary Processing Times
without Preemptions......................................296
11.2 Priority Queues, Work Conservation and Poisson Releases.....298
11.3 Arbitrary Releases and Exponential Processing Times with
Preemptions.............................................302
11.4 Poisson Releases and Arbitrary Processing Times without
Preemptions.............................................308
11.5 Discussion...............................................314
12 Parallel Machine Models (Stochastic).......................321
12.1 The Makespan and Total Completion Time without
Preemptions.............................................322
12.2 The Makespan and Total Completion Time with Preemptions .. 331
12.3 Due Date Related Objectives ..............................339
12.4 Bounds Obtained through Online Scheduling.................341
12.5 Discussion...............................................343
13 Flow Shops, Job Shops and Open Shops (Stochastic) .......349
13.1 Stochastic Flow Shops with Unlimited Intermediate Storage . . . 350
13.2 Stochastic Flow Shops with Blocking........................356
13.3 Stochastic Job Shops......................................361
13.4 Stochastic Open Shops....................................362
13.5 Discussion...............................................368
Part III Scheduling in Practice
14 General Purpose Procedures for Deterministic Scheduling 375
14.1 Dispatching Rules........................................376
14.2 Composite Dispatching Rules..............................377
14.3 Local Search: Simulated Annealing and Tabu-Search..........382
14.4 Local Search: Genetic Algorithms...........................389
14.5 Ant Colony Optimization..................................391
14.6 Discussion...............................................393
15 More Advanced General Purpose Procedures...............399
15.1 Beam Search.............................................400
15.2 Decomposition Methods and Rolling Horizon Procedures......402
15.3 Constraint Programming..................................407
15.4 Market-Based and Agent-Based Procedures..................411
15.5 Procedures for Scheduling Problems with Multiple Objectives . . 418
15.6 Discussion...............................................424
16 Modeling and Solving Scheduling Problems in Practice.....431
16.1 Scheduling Problems in Practice............................432
16.2 Cyclic Scheduling of a Flow Line...........................435
16.3 Scheduling of a Flexible Flow Line with Limited Buffers and
Bypass..................................................440
16.4 Scheduling of a Flexible Flow Line with Unlimited Buffers and
Setups..................................................445
16.5 Scheduling a Bank of Parallel Machines with Jobs having
Release Dates and Due Dates..............................452
16.6 Discussion...............................................454
17 Design and Implementation of Scheduling Systems: Basic
Concepts...................................................459
17.1 Systems Architecture.....................................460
17.2 Databases, Object Bases, and Knowledge-Bases..............462
17.3 Modules for Generating Schedules..........................467
17.4 User Interfaces and Interactive Optimization.................470
17.5 Generic Systems vs. Application-Specific Systems.............476
17.6 Implementation and Maintenance Issues.....................479
18 Design and Implementation of Scheduling Systems: More
Advanced Concepts.........................................485
18.1 Robustness and Reactive Decision Making...................486
18.2 Machine Learning Mechanisms.............................491
18.3 Design of Scheduling Engines and Algorithm Libraries ........496
18.4 Reconfigurable Systems ...................................500
18.5 Web-Based Scheduling Systems ............................502
18.6 Discussion...............................................505
19 Examples of System Designs and Implementations..........511
19.1 SAP s Production Planning and Detailed Scheduling System ... 512
19.2 IBM s Independent Agents Architecture.....................516
19.3 Real Time Dispatching and Agent Scheduling at AMD........519
19.4 ASPROVA Advanced Planning and Scheduling...............524
19-5 Preactor Planning and Scheduling Systems ..................529
19.6 Taylor Scheduling Software................................534
19.7 LEKIN - A System Developed in Academia..................539
19.8 Discussion...............................................546
20 What Lies Ahead?.......................................... 547
20.1 Theoretical Research...................................... 547
20.2 Applied Research......................................... 550
20.3 Systems Development..................................... 553
Appendices
A Mathematical Programming: Formulations and Applications 559
A.l Linear Programming Formulations..........................559
A.2 Integer Programming Formulations.........................563
A.3 Bounds, Approximations and Heuristics Based on Linear
Programming............................................567
A.4 Disjunctive Programming Formulations .....................569
B Deterministic and Stochastic Dynamic Programming.......573
B.l Deterministic Dynamic Programming.......................573
B.2 Stochastic Dynamic Programming..........................577
C Constraint Programming................................... 581
C.l Constraint Satisfaction.................................... 581
C.2 Constraint Programming.................................. 583
C.3 An Example of a Constraint Programming Language.......... 585
C.4 Constraint Programming vs. Mathematical Programming...... 586
D Complexity Theory.........................................589
D. 1 Preliminaries.............................................589
D.2 Polynomial Time Solutions versus NP-Hardness..............592
D.3 Examples................................................595
D.4 Approximation Algorithms and Schemes.....................598
E Complexity Classification of Deterministic Scheduling
Problems...................................................603
F Overview of Stochastic Scheduling Problems................607
G Selected Scheduling Systems................................611
H The Lekin System..........................................615
H.l Formatting of Input and Output Files.......................615
H.2 Linking Scheduling Programs..............................617
References......................................................623
Subject Index ..................................................661
Name Index....................................................667
|
| any_adam_object | 1 |
| author | Pinedo, Michael 1950- |
| author_GND | (DE-588)1042304629 |
| author_facet | Pinedo, Michael 1950- |
| author_role | aut |
| author_sort | Pinedo, Michael 1950- |
| author_variant | m p mp |
| building | Verbundindex |
| bvnumber | BV039886454 |
| classification_rvk | QH 465 SK 890 SK 970 |
| ctrlnum | (OCoLC)767957489 (DE-599)BSZ35376583X |
| 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 | Mathematik Wirtschaftswissenschaften |
| edition | 4. edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02822nam a2200637 c 4500</leader><controlfield tag="001">BV039886454</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170828 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120214s2012 ad|| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461419860</subfield><subfield code="c">(hbk.)</subfield><subfield code="9">978-1-4614-1986-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1461419867</subfield><subfield code="c">(hbk.)</subfield><subfield code="9">1-461-41986-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)767957489</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ35376583X</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-945</subfield><subfield code="a">DE-2070s</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-188</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 890</subfield><subfield code="0">(DE-625)143267:</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="100" ind1="1" ind2=" "><subfield code="a">Pinedo, Michael</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1042304629</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling</subfield><subfield code="b">theory, algorithms, and systems</subfield><subfield code="c">Michael L. Pinedo</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4. edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 673 Seiten</subfield><subfield code="b">Ill., graph. Darst.</subfield><subfield code="c">24 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="500" ind1=" " ind2=" "><subfield code="a">Extras: extras.springer.com</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Produktionsplanung</subfield><subfield code="0">(DE-588)4047360-0</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="650" ind1="0" ind2="7"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Systemtheorie</subfield><subfield code="0">(DE-588)4058812-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Betriebsplanung</subfield><subfield code="0">(DE-588)4006197-8</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="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Production scheduling</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><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">Produktionsplanung</subfield><subfield code="0">(DE-588)4047360-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Systemtheorie</subfield><subfield code="0">(DE-588)4058812-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><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="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Betriebsplanung</subfield><subfield code="0">(DE-588)4006197-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="a">Pinedo, Michael</subfield><subfield code="t">Scheduling</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-4614-2361-4</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=024745570&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024745570</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV039886454 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:13:25Z |
| institution | BVB |
| isbn | 9781461419860 1461419867 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024745570 |
| oclc_num | 767957489 |
| open_access_boolean | |
| owner | DE-11 DE-945 DE-2070s DE-20 DE-83 DE-19 DE-BY-UBM DE-384 DE-739 DE-188 |
| owner_facet | DE-11 DE-945 DE-2070s DE-20 DE-83 DE-19 DE-BY-UBM DE-384 DE-739 DE-188 |
| physical | XX, 673 Seiten Ill., graph. Darst. 24 cm |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| spelling | Pinedo, Michael 1950- Verfasser (DE-588)1042304629 aut Scheduling theory, algorithms, and systems Michael L. Pinedo 4. edition New York [u.a.] Springer 2012 XX, 673 Seiten Ill., graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Extras: extras.springer.com Produktionsplanung (DE-588)4047360-0 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Operations Research (DE-588)4043586-6 gnd rswk-swf Systemtheorie (DE-588)4058812-9 gnd rswk-swf Betriebsplanung (DE-588)4006197-8 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Production scheduling 1\p (DE-588)4123623-3 Lehrbuch gnd-content Produktionsplanung (DE-588)4047360-0 s Reihenfolgeproblem (DE-588)4242167-6 s Mathematik (DE-588)4037944-9 s Systemtheorie (DE-588)4058812-9 s Operations Research (DE-588)4043586-6 s 2\p DE-604 Scheduling (DE-588)4179449-7 s 3\p DE-604 Betriebsplanung (DE-588)4006197-8 s 4\p DE-604 Erscheint auch als Pinedo, Michael Scheduling Online-Ausgabe 978-1-4614-2361-4 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024745570&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Pinedo, Michael 1950- Scheduling theory, algorithms, and systems Produktionsplanung (DE-588)4047360-0 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Operations Research (DE-588)4043586-6 gnd Systemtheorie (DE-588)4058812-9 gnd Betriebsplanung (DE-588)4006197-8 gnd Scheduling (DE-588)4179449-7 gnd Mathematik (DE-588)4037944-9 gnd |
| subject_GND | (DE-588)4047360-0 (DE-588)4242167-6 (DE-588)4043586-6 (DE-588)4058812-9 (DE-588)4006197-8 (DE-588)4179449-7 (DE-588)4037944-9 (DE-588)4123623-3 |
| title | Scheduling theory, algorithms, and systems |
| title_auth | Scheduling theory, algorithms, and systems |
| title_exact_search | Scheduling theory, algorithms, and systems |
| title_full | Scheduling theory, algorithms, and systems Michael L. Pinedo |
| title_fullStr | Scheduling theory, algorithms, and systems Michael L. Pinedo |
| title_full_unstemmed | Scheduling theory, algorithms, and systems Michael L. Pinedo |
| title_short | Scheduling |
| title_sort | scheduling theory algorithms and systems |
| title_sub | theory, algorithms, and systems |
| topic | Produktionsplanung (DE-588)4047360-0 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Operations Research (DE-588)4043586-6 gnd Systemtheorie (DE-588)4058812-9 gnd Betriebsplanung (DE-588)4006197-8 gnd Scheduling (DE-588)4179449-7 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | Produktionsplanung Reihenfolgeproblem Operations Research Systemtheorie Betriebsplanung Scheduling Mathematik Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024745570&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT pinedomichael schedulingtheoryalgorithmsandsystems |