发帖
雷达卡
by Jacek Blazewicz (Author), Klaus H. Ecker (Author), Erwin Pesch (Author), Günter Schmidt (Author), Malgorzata Sterna (Author), Jan Weglarz (Author)
About the Author
Jacek Blazewicz is professor of Computer Science at the Poznan University of Technology (Poland). He is IFORS Vice President for EURO, an IEEE Fellow, and co-laureate of the EURO Gold Medal, Copernicus Prize and several Awards of the Polish Ministry of Science.
Klaus Ecker received his Ph.D. in Theoretical Physics from the University of Graz (Austria), and his habilitation in Computer Science from the University of Bonn (Germany). Since 1978 he is a professor at the Department of Computer Science of the Technical University of Clausthal (Germany), and from 2005 until 2009 he was visiting professor at the Ohio University (USA).
Erwin Pesch has Ph.D. in Mathematics and habilitation in Business Administration. He worked at universities in Darmstadt, Maastricht and Bonn. He is a professor at the Faculty of Economics and Business Administration of the University in Siegen (Germany) and director of the Center for Advanced Studies in Management (CASiM) at the HHL Leipzig Graduate School of Management (Germany). Together with Jacek Błażewicz he received the Copernicus Prize in 2012 jointly awarded by the German Research Foundation (DFG) and the Foundation for Polish Science (FNP). In 2017 he received the Science Award of the German Operations Research Society (GOR).
Malgorzata Sterna is associate professor at the Faculty of Computing of the Poznan University of Technology (Poland), from which she received Ph.D. and habilitation in Computer Science. She is a recipient of the stipend of the Foundation for Polish Science and the award of the Polish Academy of Sciences (Technical Sciences).
Günter Schmidt is professor of Operations Research and Business Informatics at the Computer Science Department and the Business School at Saarland University (Germany). He is member of Graduate School for Computer Science, researcher at Max Planck Institut Informatik and director of the Institute of Information and Communication Systems. He is also honorary professor at the University of Cape Town (South Africa).
Jan Węglarz is professor of Computing at the Poznań University of Technology (Poland), and director of the Poznań Supercomputing and Networking Center. He is co-laureate of the EURO Gold Medal and a recipient of the Foundation for Polish Science Award.
About this book
This book provides a theoretical and application-oriented analysis of deterministic scheduling problems in advanced planning and computer systems. The text examines scheduling problems across a range of parameters: job priority, release times, due dates, processing times, precedence constraints, resource usage and more, focusing on such topics as computer systems and supply chain management. Discussion includes single and parallel processors, flexible shops and manufacturing systems, and resource-constrained project scheduling. Many applications from industry and service operations management and case studies are described. The handbook will be useful to a broad audience, from researchers to practitioners, graduate and advanced undergraduate students.
Brief contents
1 Introduction 1
References 9
2 Basics 11
2.1 Sets and Relations 11
2.2 Problems, Algorithms, Complexity 13
2.3 Graphs and Networks 23
2.4 Enumerative Methods 34
2.5 Heuristic and Approximation Algorithms 37
References 55
3 Definition, Analysis and Classification of Scheduling Problems 61
3.1 Definition of Scheduling Problems 61
3.2 Analysis of Scheduling Problems and Algorithms 66
3.3 Motivations for Deterministic Scheduling Problems 69
3.4 Classification of Deterministic Scheduling Problems 72
References 75
4 Scheduling on One Processor 77
4.1 Minimizing Schedule Length 77
4.2 Minimizing Mean Weighted Flow Time 87
4.3 Minimizing Due Date Involving Criteria 99
4.4 Minimizing Change-Over Cost 118
4.5 Other Criteria. 126
References 134
5 Scheduling on Parallel Processors 141
5.1 Minimizing Schedule Length 141
5.2 Minimizing Mean Flow Time 172
5.3 Minimizing Due Date Involving Criteria 177
5.4 Lot Size Scheduling 186
References 191
6 Communication Delays and Multiprocessor Tasks 199
6.1 Introductory Remarks 199
6.2 Scheduling Multiprocessor Tasks 205
6.3 Scheduling Uniprocessor Tasks with Communication Delays 221
6.4 Scheduling Divisible Tasks 228
References 236
7 Scheduling in Hard Real-Time Systems 243
7.1 Introduction 243
7.2 Basic Notions 248
7.3 Single Processor Scheduling 252
7.4 Scheduling Periodic Tasks on Parallel Processors 264
7.5 Resources 265
7.6 Variations of the Periodic Task Model 266
References 267
8 Flow Shop Scheduling. 271
8.1 Introduction 271
8.2 Exact Methods 274
8.3 Approximation Algorithms 282
8.4 Scheduling Flexible Flow Shops 291
References 316
9 Open Shop Scheduling 321
9.1 Complexity Results 321
9.2 A Branch and Bound Algorithm for Open Shop Scheduling 323
References 341
10 Scheduling in Job Shops 345
10.1 Introduction 345
10.2 Exact Methods 357
10.3 Approximation Algorithms 365
10.4 Conclusions 392
References 393
11 Scheduling with Limited Processor Availability 403
11.1 Problem Definition 404
11.2 One Machine Problems 407
11.3 Parallel Machine Problems 409
11.4 Shop Problems 420
11.5 Conclusions 423
References 425
12 Time-Dependent Scheduling 431
12.1 Introduction 432
12.2 Forms of Time-Dependent Processing Times 433
12.3 One Machine Problems 436
12.4 Parallel Machine Problems 457
12.5 Dedicated Machine Problems 463
References 467
13 Scheduling under Resource Constraints 475
13.1 Classical Model 475
13.2 Scheduling Multiprocessor Tasks 486
13.3 Scheduling with Continuous Resources 500
References 521
14 Scheduling Imprecise Computations 527
14.1 Introduction 527
14.2 Imprecise Computation Model 530
14.3 Late Work Model 532
14.4 Related Problems 566
14.5 Conclusions 569
References 570
15 Online Scheduling 577
15.1 Online Scheduling Models 578
15.2 Online Scheduling Algorithms 580
15.3 Competitive Analysis 581
15.4 Other Online Scheduling Models 590
15.5 Conclusions 602
References 602
16 Constraint Programming and Disjunctive Scheduling 609
16.1 Introduction 609
16.2 Constraint Satisfaction 611
16.3 The Disjunctive Scheduling Problem 625
16.4 Constraint Propagation and the DSP 629
16.5 Conclusions 662
16.6 Appendix: Bound Consistency Revisited 663
References 667
17 Scheduling in Flexible Manufacturing Systems 671
17.1 Introductory Remarks 671
17.2 Scheduling Dynamic Job Shops 674
17.3 Simultaneous Scheduling and Routing in some FMS 682
17.4 Batch Scheduling in Flexible Flow Shops under Resource Constraints 691
References 709
18 Computer Integrated Production Scheduling 713
18.1 Scheduling in Computer Integrated Manufacturing 714
18.2 A Reference Model for Production Scheduling 719
18.3 IPS: An Intelligent Production Scheduling System 727
References 758
19 Scheduling in Logistics 761
19.1 Introduction 761
19.2 Vehicle Routing Problem 762
19.3 Concrete Delivery Problem 767
19.4 Flight Gate Scheduling Problem 779
19.5 Berth and Quay Crane Allocation Problem 792
19.6 Conclusions 802
References 802
Index 813
Series: International Handbooks on Information Systems
Pages: 833 pages
Publisher: Springer; 2nd ed. 2019 edition (May 7, 2019)
Language: English
ISBN-10: 331999848X
ISBN-13: 978-3319998480
Springer__Handbook on Scheduling.pdf
(8.05 MB, 需要: 30 个论坛币)
京公网安备 11010802022788号
