Principles of sequencing and scheduling:
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Hoboken, NJ
Wiley
2009
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Item Description: | Includes bibliographical references and index |
| Physical Description: | XV, 493 S. graph. Darst. |
| ISBN: | 9780470391655 0470391650 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV025549641 | ||
| 003 | DE-604 | ||
| 005 | 20141029 | ||
| 007 | t | ||
| 008 | 100417s2009 d||| |||| 00||| eng d | ||
| 020 | |a 9780470391655 |9 978-0-470-39165-5 | ||
| 020 | |a 0470391650 |9 0-470-39165-0 | ||
| 035 | |a (OCoLC)636360122 | ||
| 035 | |a (DE-599)BVBBV025549641 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 |a DE-739 |a DE-384 | ||
| 084 | |a QH 465 |0 (DE-625)141600: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Baker, Kenneth R. |d 1943- |e Verfasser |0 (DE-588)170202895 |4 aut | |
| 245 | 1 | 0 | |a Principles of sequencing and scheduling |c Kenneth R. Baker ; Dan Trietsch |
| 264 | 1 | |a Hoboken, NJ |b Wiley |c 2009 | |
| 300 | |a XV, 493 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 650 | 0 | 7 | |a Fertigung |0 (DE-588)4016899-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Reihenfolgeplanung |0 (DE-588)4261341-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Reihenfolgeplanung |0 (DE-588)4261341-3 |D s |
| 689 | 0 | 1 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 0 | 2 | |a Fertigung |0 (DE-588)4016899-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Trietsch, Dan |e Verfasser |0 (DE-588)170295621 |4 aut | |
| 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=020150155&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020150155 | ||
Record in the Search Index
| _version_ | 1804142723217752064 |
|---|---|
| adam_text | Titel: Principles of sequencing and scheduling
Autor: Baker, Kenneth R.
Jahr: 2009
CONTENTS
Preface xiii
1 Introduction 1
1.1 Introduction to Sequencing and Scheduling. 1
1.2 Scheduling Theory, 3
1.3 Philosophy and Coverage of the Book, 6
References, 8
2 Single-Machine Sequencing 10
2.1 Introduction, 10
2.2 Preliminaries, 11
2.3 Problems Without Due Dates: Elementary Results. 15
2.3.1 Flowtime and Inventory, 15
2.3.2 Minimizing Total Flowtime. 16
2.3.3 Minimizing Total Weighted Flowtime. 19
2.4 Problems with Due Dates: Elementary Results. 21
2.4.1 Lateness Criteria, 21
2.4.2 Minimizing the Number of Tardy Jobs. 24
2.4.3 Minimizing Total Tardiness. 25
2.4.4 Due Dates as Decisions. 29
2.5 Summary. 31
References, 31
Exercises, 32
vi CONTENTS
3 Optimization Methods for the Single-Machine Problem 34
3.1 Introduction, 34
3.2 Adjacent Pairwise Interchange Methods, 36
3.3 A Dynamic Programming Approach, 37
3.4 Dominance Properties, 43
3.5 A Branch and Bound Approach, 47
3.6 Summary, 53
References, 55
Exercises, 55
4 Heuristic Methods for the Single-Machine Problem 57
4.1 Introduction, 57
4.2 Dispatching and Construction Procedures, 58
4.3 Random Sampling, 63
4.4 Neighborhood Search Techniques, 66
4.5 Tabu Search, 70
4.6 Simulated Annealing, 72
4.7 Genetic Algorithms, 74
4.8 The Evolutionary Solver, 75
4.9 Summary, 79
References, 81
Exercises, 81
5 Earliness and Tardiness Costs 86
5.1 Introduction, 86
5.2 Minimizing Deviations from a Common Due Date, 88
5.2.1 Four Basic Results, 88
5.2.2 Due Dates as Decisions, 93
5.3 The Restricted Version, 94
5.4 Asymmetric Earliness and Tardiness Costs, 96
5.5 Quadratic Costs, 99
5.6 Job-Dependent Costs, 100
5.7 Distinct Due Dates, 101
5.8 Summary, 104
References, 105
Exercises, 105
6 Sequencing for Stochastic Scheduling 108
6.1 Introduction, 108
6.2 Basic Stochastic Counterpart Models, 109
6.3 The Deterministic Counterpart, 115
6.4 Minimizing the Maximum Cost, 117
6.5 The Jensen Gap, 122
6.6 Stochastic Dominance and Association, 123
CONTENTS vii
6.7 Using Risk Solver, 127
6.8 Summary, 132
References, 134
Exercises, 134
7 Safe Scheduling 137
7.1 Introduction, 137
7.2 Meeting Service-Level Targets, 138
7.3 Trading Off Tightness and Tardiness, 141
7.4 The Stochastic E/T Problem, 145
7.5 Setting Release Dates, 149
7.6 The Stochastic (/-Problem: A Service-Level Approach, 152
7.7 The Stochastic U-Pmblem: An Economic Approach, 156
7.8 Summary, 160
References, 161
Exercises, 162
8 Extensions of the Basic Model 165
8.1 Introduction, 165
8.2 Nonsimultaneous Arrivals. 166
8.2.1 Minimizing the Makespan, 169
8.2.2 Minimizing Maximum Tardiness, 171
8.2.3 Other Measures of Performance, 172
8.3 Related Jobs, 174
8.3.1 Minimizing Maximum Tardiness, 175
8.3.2 Minimizing Total Flowtime with Strings, 176
8.3.3 Minimizing Total Flowtime with Parallel Chains, 178
8.4 Sequence-Dependent Setup Times, 181
8.4.1 Dynamic Programming Solutions, 183
8.4.2 Branch and Bound Solutions, 184
8.4.3 Heuristic Solutions, 189
8.5 Stochastic Models with Sequence-Dependent Setup Times. 190
8.5.1 Setting Tight Due Dates, 191
8.5.2 Revisiting the Tightness/Tardiness Trade-off, 192
8.6 Summary, 195
References. 196
Exercises, 197
9 Parallel-Machine Models 200
9.1 Introduction, 200
9.2 Minimizing the Makespan. 201
9.2.1 Nonpreemptable Jobs, 202
9.2.2 Nonpreemptable Related Jobs, 208
9.2.3 Preemptable Jobs, 211
viii CONTENTS
9.3 Minimizing Total Flowtime, 213
9.4 Stochastic Models, 217
9.4.1 The Makespan Problem with Exponential Processing
Times, 218
9.4.2 Safe Scheduling with Parallel Machines, 220
9.5 Summary, 221
References, 222
Exercises, 223
10 Flow Shop Scheduling 225
10.1 Introduction, 225
10.2 Permutation Schedules, 228
10.3 The Two-Machine Problem, 230
10.3.1 Johnson s Rule, 230
10.3.2 A Proof of Johnson s Rule, 232
10.3.3 The Model with Time Lags, 234
10.3.4 The Model with Setups, 235
10.4 Special Cases of The Three-Machine Problem, 236
10.5 Minimizing the Makespan, 237
10.5.1 Branch and Bound Solutions, 238
10.5.2 Heuristic Solutions, 241
10.6 Variations of the m-Machine Model, 243
10.6.1 Ordered Flow Shops, 243
10.6.2 Flow Shops with Blocking, 244
10.6.3 No-Wait Flow Shops, 245
10.7 Summary, 247
References, 248
Exercises, 249
11 Stochastic Flow Shop Scheduling 251
11.1 Introduction, 251
11.2 Stochastic Counterpart Models, 252
11.3 Safe Scheduling Models with Stochastic Independence, 258
11.4 Flow Shops with Linear Association, 261
11.5 Empirical Observations, 262
11.6 Summary, 267
References, 268
Exercises, 269
12 Lot Streaming Procedures for the Flow Shop 271
12.1 Introduction, 271
12.2 The Basic Two-Machine Model, 273
12.2.1 Preliminaries, 273
12.2.2 The Continuous Version, 274
CONTENTS ix
12.2.3 The Discrete Version, 277
12.2.4 Models with Setups, 279
12.3 The Three-Machine Model with Consistent Sublots, 281
12.3.1 The Continuous Version, 281
12.3.2 The Discrete Version, 284
12.4 The Three-Machine Model with Variable Sublots, 285
12.4.1 Item and Batch Availability, 285
12.4.2 The Continuous Version, 285
12.4.3 The Discrete Version, 287
12.4.4 Computational Experiments, 290
12.5 The Fundamental Partition, 292
12.5.1 Denning the Fundamental Partition, 292
12.5.2 A Heuristic Procedure for s Sublots, 295
12.6 Summary, 295
References, 297
Exercises, 298
13 Scheduling Groups of Jobs 300
13.1 Introduction, 300
13.2 Scheduling Job Families, 301
13.2.1 Minimizing Total Weighted Flowtime, 302
13.2.2 Minimizing Maximum Lateness, 304
13.2.3 Minimizing Makespan in the Two-Machine Flow
Shop, 306
13.3 Scheduling with Batch Availability, 309
13.4 Scheduling with a Batch Processor, 313
13.4.1 Minimizing the Makespan with Dynamic
Arrivals, 314
13.4.2 Minimizing Makespan in the Two-Machine
Flow Shop, 315
13.4.3 Minimizing Total Flowtime with Dynamic
Arrivals, 317
13.4.4 Batch-Dependent Processing Times, 318
13.5 Summary, 320
References, 321
Exercises, 322
14 The Job Shop Problem 325
14.1 Introduction, 325
14.2 Types of Schedules, 328
14.3 Schedule Generation. 333
14.4 The Shifting Bottleneck Procedure, 337
14.4.1 Bottleneck Machines. 338
14.4.2 Heuristic and Optimal Solutions, 339
X CONTENTS
14.5 Neighborhood Search Heuristics, 342
14.6 Summary, 345
References, 346
Exercises, 347
15 Simulation Models for the Dynamic Job Shop 349
15.1 Introduction, 349
15.2 Model Elements, 350
15.3 Types of Dispatching Rules, 352
15.4 Reducing Mean Flowtime, 354
15.5 Meeting Due Dates, 357
15.5.1 Background, 357
15.5.2 Some Clarifying Experiments, 362
15.5.3 Experimental Results, 364
15.6 Summary, 369
References, 370
16 Network Methods for Project Scheduling 372
16.1 Introduction, 372
16.2 Logical Constraints and Network Construction, 373
16.3 Temporal Analysis of Networks, 376
16.4 The Time/Cost Trade-off, 381
16.5 Traditional Probabilistic Network Analysis, 385
16.5.1 The PERT Method, 385
16.5.2 Theoretical Limitations of PERT, 389
16.6 Summary, 393
References, 394
Exercises, 395
17 Resource-Constrained Project Scheduling 398
17.1 Introduction, 398
17.2 Extending the Job Shop Model, 399
17.3 Extending the Project Model, 405
17.4 Heuristic Construction and Search Algorithms, 407
17.4.1 Construction Heuristics, 408
17.4.2 Neighborhood Search Improvement Schemes, 410
17.4.3 Selecting Priority Lists, 412
17.5 Summary, 414
References, 415
Exercises, 415
18 Safe Scheduling for Projects 418
18.1 Introduction, 418
18.2 Stochastic Balance Principles For Activity Networks, 420
18.2.1 The Assembly Coordination Model, 420
18.2.2 Balancing a General Project Network, 426
CONTENTS xi
18.2.3 Additional Examples, 428
18.2.4 Hierarchical Balancing, 434
18.3 Crashing Stochastic Activities, 436
18.4 Summary, 439
References, 441
Exercises, 441
Appendix A Practical Processing Time Distributions 445
A.1 Important Processing Time Distributions, 445
A. 1.1 The Uniform Distribution, 445
A. 1.2 The Exponential Distribution, 446
A. 1.3 The Normal Distribution, 447
A. 1.4 The Lognormal Distribution, 447
A. 1.5 The Parkinson Distribution, 449
A.2 Increasing and Decreasing Completion Rates, 450
A.3 Stochastic Dominance, 451
A.4 Linearly Associated Processing Times, 452
References, 458
Appendix B The Critical Ratio Rule 459
B.I A Basic Trade-off Problem. 459
B.2 Optimal Policy for Discrete Probability Models. 461
B.3 A Special Discrete Case: Equally Likely Outcomes. 463
B.4 Optimal Policy for Continuous Probability Models. 463
B.5 A Special Continuous Case: The Normal Distribution. 467
B.6 Calculating d + yE(T) for the Normal Distribution. 469
References, 470
Appendix C Integer Programming Models for Sequencing 471
C.I Introduction. 471
C.2 The Single-Machine Model. 472
C.2.1 Sequence-Position Decisions, 472
C.2.2 Precedence Decisions. 473
C.2.3 Time-Indexed Decisions. 473
C.3 The Flow Shop Model. 475
References. 477
Name Index 479
Subject Index 483
|
| any_adam_object | 1 |
| author | Baker, Kenneth R. 1943- Trietsch, Dan |
| author_GND | (DE-588)170202895 (DE-588)170295621 |
| author_facet | Baker, Kenneth R. 1943- Trietsch, Dan |
| author_role | aut aut |
| author_sort | Baker, Kenneth R. 1943- |
| author_variant | k r b kr krb d t dt |
| building | Verbundindex |
| bvnumber | BV025549641 |
| classification_rvk | QH 465 SK 890 |
| ctrlnum | (OCoLC)636360122 (DE-599)BVBBV025549641 |
| discipline | Mathematik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01660nam a2200409 c 4500</leader><controlfield tag="001">BV025549641</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20141029 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100417s2009 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780470391655</subfield><subfield code="9">978-0-470-39165-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0470391650</subfield><subfield code="9">0-470-39165-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)636360122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV025549641</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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-739</subfield><subfield code="a">DE-384</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="100" ind1="1" ind2=" "><subfield code="a">Baker, Kenneth R.</subfield><subfield code="d">1943-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170202895</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Principles of sequencing and scheduling</subfield><subfield code="c">Kenneth R. Baker ; Dan Trietsch</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">Wiley</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 493 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">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fertigung</subfield><subfield code="0">(DE-588)4016899-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Reihenfolgeplanung</subfield><subfield code="0">(DE-588)4261341-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Reihenfolgeplanung</subfield><subfield code="0">(DE-588)4261341-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Fertigung</subfield><subfield code="0">(DE-588)4016899-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">Trietsch, Dan</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170295621</subfield><subfield code="4">aut</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=020150155&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-020150155</subfield></datafield></record></collection> |
| id | DE-604.BV025549641 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:36:18Z |
| institution | BVB |
| isbn | 9780470391655 0470391650 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020150155 |
| oclc_num | 636360122 |
| open_access_boolean | |
| owner | DE-11 DE-739 DE-384 |
| owner_facet | DE-11 DE-739 DE-384 |
| physical | XV, 493 S. graph. Darst. |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Wiley |
| record_format | marc |
| spelling | Baker, Kenneth R. 1943- Verfasser (DE-588)170202895 aut Principles of sequencing and scheduling Kenneth R. Baker ; Dan Trietsch Hoboken, NJ Wiley 2009 XV, 493 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references and index Fertigung (DE-588)4016899-2 gnd rswk-swf Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Reihenfolgeplanung (DE-588)4261341-3 gnd rswk-swf Reihenfolgeplanung (DE-588)4261341-3 s Optimierungsproblem (DE-588)4390818-4 s Fertigung (DE-588)4016899-2 s DE-604 Trietsch, Dan Verfasser (DE-588)170295621 aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020150155&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Baker, Kenneth R. 1943- Trietsch, Dan Principles of sequencing and scheduling Fertigung (DE-588)4016899-2 gnd Optimierungsproblem (DE-588)4390818-4 gnd Reihenfolgeplanung (DE-588)4261341-3 gnd |
| subject_GND | (DE-588)4016899-2 (DE-588)4390818-4 (DE-588)4261341-3 |
| title | Principles of sequencing and scheduling |
| title_auth | Principles of sequencing and scheduling |
| title_exact_search | Principles of sequencing and scheduling |
| title_full | Principles of sequencing and scheduling Kenneth R. Baker ; Dan Trietsch |
| title_fullStr | Principles of sequencing and scheduling Kenneth R. Baker ; Dan Trietsch |
| title_full_unstemmed | Principles of sequencing and scheduling Kenneth R. Baker ; Dan Trietsch |
| title_short | Principles of sequencing and scheduling |
| title_sort | principles of sequencing and scheduling |
| topic | Fertigung (DE-588)4016899-2 gnd Optimierungsproblem (DE-588)4390818-4 gnd Reihenfolgeplanung (DE-588)4261341-3 gnd |
| topic_facet | Fertigung Optimierungsproblem Reihenfolgeplanung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020150155&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bakerkennethr principlesofsequencingandscheduling AT trietschdan principlesofsequencingandscheduling |