Scheduling: theory, algorithms, and systems
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cham ; Heidelberg ; New York ; Dordrecht ; London
Springer
[2016]
|
| Ausgabe: | Fifth edition |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke Auf dem Umschlag: Extras online |
| Beschreibung: | xx, 670 Seiten Illustrationen (teilweise farbig), Diagramme |
| ISBN: | 9783319265780 9783319799735 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV043449370 | ||
| 003 | DE-604 | ||
| 005 | 20220406 | ||
| 007 | t | ||
| 008 | 160310s2016 a||| |||| 00||| eng d | ||
| 020 | |a 9783319265780 |c hardcover |9 978-3-319-26578-0 | ||
| 020 | |a 9783319799735 |c softcover |9 978-3-319-79973-5 | ||
| 035 | |a (OCoLC)945375528 | ||
| 035 | |a (DE-599)BVBBV043449370 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 |a DE-573 |a DE-521 |a DE-706 |a DE-1050 |a DE-83 |a DE-188 |a DE-384 |a DE-355 | ||
| 082 | 0 | |a 519.6 |2 23 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a QP 542 |0 (DE-625)141900: |2 rvk | ||
| 084 | |a QH 465 |0 (DE-625)141600: |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 Fifth edition | ||
| 264 | 1 | |a Cham ; Heidelberg ; New York ; Dordrecht ; London |b Springer |c [2016] | |
| 264 | 4 | |c © 2016 | |
| 300 | |a xx, 670 Seiten |b Illustrationen (teilweise farbig), Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 500 | |a Auf dem Umschlag: Extras online | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a System theory | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Management science | |
| 650 | 4 | |a Probabilities | |
| 650 | 4 | |a Industrial engineering | |
| 650 | 4 | |a Production engineering | |
| 650 | 4 | |a Operations Research, Management Science | |
| 650 | 4 | |a Industrial and Production Engineering | |
| 650 | 4 | |a Probability Theory and Stochastic Processes | |
| 650 | 4 | |a Systems Theory, Control | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Produktionsplanung |0 (DE-588)4047360-0 |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 Reihenfolgeproblem |0 (DE-588)4242167-6 |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 |
| 650 | 0 | 7 | |a Systemtheorie |0 (DE-588)4058812-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |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 | |5 DE-604 | |
| 689 | 1 | 0 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Betriebsplanung |0 (DE-588)4006197-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-319-26580-3 |
| 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=028866802&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028866802 | ||
Datensatz im Suchindex
| _version_ | 1804176057238028288 |
|---|---|
| adam_text | Titel: Scheduling
Autor: Pinedo, Michael
Jahr: 2016
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....................................... 7
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..................................... 25
3 Single Machine Models (Deterministic)..................... 33
3.1 The Total Weighted Completion Time ...................... 34
3.2 The Maximum Lateness................................... 40
3.3 The Number of Tardy Jobs................................ 45
3.4 The Total Tardiness - Dynamic Programming................ 49
3.5 The Total Tardiness - An Approximation Scheme............. 53
3.6 The Total Weighted Tardiness ............................. 56
3.7 Online Scheduling........................................ 59
3.8 Discussion............................................... 64
4 Advanced Single Machine Models (Deterministic) .......... 71
4.1 The Total Earliness and Tardiness.......................... 72
4.2 Primary and Secondary Objectives ......................... 79
xiv Contents
4.3 Multiple Objectives: A Parametric Analysis.................. 81
4.4 The Makespan with Sequence Dependent Setup
Times................................................... 84
4.5 Job Families with Setup Times............................. 93
4.6 Batch Processing.........................................100
4.7 Discussion...............................................106
5 Parallel Machine Models (Deterministic)...................113
5.1 The Makespan without Preemptions........................114
5.2 The Makespan with Preemptions...........................124
5.3 The Total Completion Time without Preemptions............131
5.4 The Total Completion Time with Preemptions...............135
5.5 Due Date Related Objectives ..............................137
5.6 Online Scheduling........................................139
5.7 Discussion...............................................143
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...............162
6.3 Proportionate Flow Shops with Unlimited and Limited
Intermediate Storage......................................168
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...............................................214
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...................232
8.5 The Number of Tardy Jobs................................237
8.6 Discussion...............................................238
Part II Stochastic Models
9 Stochastic Models: Preliminaries ...........................245
9.1 Framework and Notation..................................245
9.2 Distributions and Classes of Distributions...................246
9.3 Stochastic Dominance.....................................250
Contents xv
9.4 Impact of Randomness on Fixed Schedules...................253
9.5 Classes of Policies........................................257
10 Single Machine Models (Stochastic) ........................265
10.1 Arbitrary Distributions without Preemptions................265
10.2 Arbitrary Distributions with Preemptions: the Gittins Index ... 272
10.3 Likelihood Ratio Ordered Distributions .....................277
10.4 Exponential Distributions .................................280
10.5 Discussion...............................................287
11 Single Machine Models with Release Dates (Stochastic) .... 293
11.1 Arbitrary Release Dates and Arbitrary Processing Times
without Preemptions......................................294
11.2 Priority Queues, Work Conservation, and Poisson Releases.....296
11.3 Arbitrary Releases and Exponential Processing Times with
Preemptions.............................................300
11.4 Poisson Releases and Arbitrary Processing Times without
Preemptions.............................................306
11.5 Discussion...............................................312
12 Parallel Machine Models (Stochastic).......................319
12.1 The Makespan and Total Completion Time without
Preemptions.............................................320
12.2 The Makespan and Total Completion Time with Preemptions .. 329
12.3 Due Date Related Objectives ..............................339
12.4 Bounds Obtained through Online Scheduling.................340
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
xvi Contents
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..........509
19.1 SAP s Production Planning and Detailed Scheduling System ... 510
19.2 IBM s Independent Agents Architecture.....................514
19.3 Real Time Dispatching and Agent Scheduling at AMD........517
19.4 ASPROVA Advanced Planning and Scheduling...............523
19.5 Preactor Planning and Scheduling Systems..................527
19.6 ORTEMS Agile Manufacturing Suite.......................532
Contents xvii
19.7 LEKIN - A System Developed in Academia..................536
19.8 Discussion...............................................543
20 What Lies Ahead?..........................................545
20.1 Theoretical Research......................................545
20.2 Applied Research.........................................548
20.3 Systems Development.....................................551
Appendices
A Mathematical Programming: Formulations
and Applications ...........................................557
A.l Linear Programming Formulations..........................557
A.2 Integer Programming Formulations.........................561
A.3 Bounds, Approximations, and Heuristics Based on Linear
Programming............................................565
A.4 Disjunctive Programming Formulations .....................567
B Deterministic and Stochastic Dynamic Programming.......571
B.l Deterministic Dynamic Programming.......................571
B.2 Stochastic Dynamic Programming..........................575
C Constraint Programming...................................577
C.l Constraint Satisfaction....................................577
C.2 Constraint Programming..................................579
C.3 An Example of a Constraint Programming Language..........581
C.4 Constraint Programming vs. Mathematical Programming......582
D Complexity Theory.........................................585
D.l Preliminaries.............................................585
D.2 Polynomial Time Solutions versus NP-Hardness..............588
D.3 Examples................................................591
D.4 Approximation Algorithms and Schemes.....................594
E Complexity Classification of Deterministic Scheduling
Problems...................................................599
F Overview of Stochastic Scheduling Problems................603
G Selected Scheduling Systems................................609
H The Lekin System..........................................613
H.l Formatting of Input and Output Files.......................613
H.2 Linking Scheduling Programs..........................___615
xvüi Contents
References......................................................621
Author Index...................................................657
Subject Index ..................................................665
|
| 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 | BV043449370 |
| classification_rvk | ST 134 SK 970 QP 542 QH 465 |
| ctrlnum | (OCoLC)945375528 (DE-599)BVBBV043449370 |
| dewey-full | 519.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.6 |
| dewey-search | 519.6 |
| dewey-sort | 3519.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik Wirtschaftswissenschaften |
| edition | Fifth edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03086nam a2200757 c 4500</leader><controlfield tag="001">BV043449370</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220406 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">160310s2016 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319265780</subfield><subfield code="c">hardcover</subfield><subfield code="9">978-3-319-26578-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319799735</subfield><subfield code="c">softcover</subfield><subfield code="9">978-3-319-79973-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)945375528</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043449370</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-573</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.6</subfield><subfield code="2">23</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">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QP 542</subfield><subfield code="0">(DE-625)141900:</subfield><subfield code="2">rvk</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="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">Fifth edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham ; Heidelberg ; New York ; Dordrecht ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xx, 670 Seiten</subfield><subfield code="b">Illustrationen (teilweise farbig), Diagramme</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">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Auf dem Umschlag: Extras online</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">System theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Management science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probabilities</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Industrial engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research, Management Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Industrial and Production Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability Theory and Stochastic Processes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems Theory, Control</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</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">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">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">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="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="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">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="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="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="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-319-26580-3</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=028866802&sequence=000001&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-028866802</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV043449370 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:26:08Z |
| institution | BVB |
| isbn | 9783319265780 9783319799735 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028866802 |
| oclc_num | 945375528 |
| open_access_boolean | |
| owner | DE-11 DE-573 DE-521 DE-706 DE-1050 DE-83 DE-188 DE-384 DE-355 DE-BY-UBR |
| owner_facet | DE-11 DE-573 DE-521 DE-706 DE-1050 DE-83 DE-188 DE-384 DE-355 DE-BY-UBR |
| physical | xx, 670 Seiten Illustrationen (teilweise farbig), Diagramme |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Springer |
| record_format | marc |
| spelling | Pinedo, Michael 1950- Verfasser (DE-588)1042304629 aut Scheduling theory, algorithms, and systems Michael L. Pinedo Fifth edition Cham ; Heidelberg ; New York ; Dordrecht ; London Springer [2016] © 2016 xx, 670 Seiten Illustrationen (teilweise farbig), Diagramme txt rdacontent n rdamedia nc rdacarrier Hier auch später erschienene, unveränderte Nachdrucke Auf dem Umschlag: Extras online Mathematics System theory Operations research Management science Probabilities Industrial engineering Production engineering Operations Research, Management Science Industrial and Production Engineering Probability Theory and Stochastic Processes Systems Theory, Control Mathematik Produktionsplanung (DE-588)4047360-0 gnd rswk-swf Operations Research (DE-588)4043586-6 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 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 Systemtheorie (DE-588)4058812-9 gnd rswk-swf (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 DE-604 Scheduling (DE-588)4179449-7 s Betriebsplanung (DE-588)4006197-8 s Erscheint auch als Online-Ausgabe 978-3-319-26580-3 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028866802&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Pinedo, Michael 1950- Scheduling theory, algorithms, and systems Mathematics System theory Operations research Management science Probabilities Industrial engineering Production engineering Operations Research, Management Science Industrial and Production Engineering Probability Theory and Stochastic Processes Systems Theory, Control Mathematik Produktionsplanung (DE-588)4047360-0 gnd Operations Research (DE-588)4043586-6 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Betriebsplanung (DE-588)4006197-8 gnd Scheduling (DE-588)4179449-7 gnd Mathematik (DE-588)4037944-9 gnd Systemtheorie (DE-588)4058812-9 gnd |
| subject_GND | (DE-588)4047360-0 (DE-588)4043586-6 (DE-588)4242167-6 (DE-588)4006197-8 (DE-588)4179449-7 (DE-588)4037944-9 (DE-588)4058812-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 | Mathematics System theory Operations research Management science Probabilities Industrial engineering Production engineering Operations Research, Management Science Industrial and Production Engineering Probability Theory and Stochastic Processes Systems Theory, Control Mathematik Produktionsplanung (DE-588)4047360-0 gnd Operations Research (DE-588)4043586-6 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Betriebsplanung (DE-588)4006197-8 gnd Scheduling (DE-588)4179449-7 gnd Mathematik (DE-588)4037944-9 gnd Systemtheorie (DE-588)4058812-9 gnd |
| topic_facet | Mathematics System theory Operations research Management science Probabilities Industrial engineering Production engineering Operations Research, Management Science Industrial and Production Engineering Probability Theory and Stochastic Processes Systems Theory, Control Mathematik Produktionsplanung Operations Research Reihenfolgeproblem Betriebsplanung Scheduling Systemtheorie Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028866802&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT pinedomichael schedulingtheoryalgorithmsandsystems |