Atjaunināt sīkdatņu piekrišanu

Handbook on Scheduling: From Theory to Applications 2007 [Hardback]

4.00/5 (5 ratings by Goodreads)
, , , ,
  • Formāts: Hardback, 647 pages, height x width: 235x155 mm, weight: 1148 g, 28 Tables, black and white; XII, 647 p., 1 Hardback
  • Sērija : International Handbooks on Information Systems
  • Izdošanas datums: 12-Jun-2007
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540280464
  • ISBN-13: 9783540280460
Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 176,32 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 207,44 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Handbook on Scheduling: From Theory to Applications 2007Palielināt
  • Formāts: Hardback, 647 pages, height x width: 235x155 mm, weight: 1148 g, 28 Tables, black and white; XII, 647 p., 1 Hardback
  • Sērija : International Handbooks on Information Systems
  • Izdošanas datums: 12-Jun-2007
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540280464
  • ISBN-13: 9783540280460
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783540280460.html
Keywords:
This book provides both theoretical and real world analysis of advanced scheduling, with a focus on highly sophisticated planning and computer systems. Focusing on such topics as computer systems and supply chain management, the text examines specific scheduling problems across a range of parameters: job priority, release times, due dates, processing times, precedence constraints, resource usage and more. Analysis and solutions are presented through polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches. The book explores a broad range of problems including single and parallel processors, flexible shops and manufacturing systems, and resource-constrained project scheduling.

This handbook covers not only in a unified approach the most important scheduling models and methods, it also put special emphasis to their relevance to practical situations. Many applications from industry and service operations management and case studies are described. Because the book offers some preliminaries concerning basic notions from discrete mathematics, it can also be used by beginners. As a consequence, the handbook is an indispensable source for a broad audience, ranging from researchers to practitioners, graduate and advanced undergraduate students in computer science/engineering, operations research, industrial and real-time engineering, management science, business administration, information systems, and applied mathematics curricula.

Recenzijas

From the reviews:



"What distinguishes the present book by Blazewicz et al. from a number of other new and interesting books on scheduling is its emphasis on the relevance of academic research to practical applications, which is precisely manifested in its title. Overall, the reviewed book is a very significant contribution to literature on scheduling and a must for anyone who is involved in the field as a student, researcher or practitioner. I heartily recommend it for study." (Eugene Levner, Journal of Scheduling, Vol. 12, 2009)

1 Introduction
1
References
7
2 Basics
9
2.1 Sets and Relations
9
2.2 Problems, Algorithms, Complexity
11
2.2.1 Problems and Their Encoding
11
2.2.2 Algorithms
13
2.2.3 Complexity
16
2.3 Graphs and Networks
21
2.3.1 Basic Notions
21
2.3.2 Special Classes of Digraphs
22
2.3.3 Networks
25
2.4 Enumerative Methods
32
2.4.1 Dynamic Programming
33
2.4.2 Branch and Bound
33
2.5 Heuristic and Approximation Algorithms
35
2.5.1 Approximation Algorithms
35
2.5.2 Local Search Heuristics
37
References
52
3 Definition, Analysis and Classification of Scheduling Problems
57
3.1 Definition of Scheduling Problems
57
3.2 Analysis of Scheduling Problems and Algorithms
62
3.3 Motivations for Deterministic Scheduling Problems
65
3.4 Classification of Deterministic Scheduling Problems
68
References
71
4 Scheduling on One Processor
73
4.1 Minimizing Schedule Length
73
4.1.1 Scheduling with Release Times and Deadlines
74
4.1.2 Scheduling with Release Times and Delivery Times
81
4.2 Minimizing Mean Weighted Flow Time
83
4.3 Minimizing Due Date Involving Criteria
95
4.3.1 Maximum Lateness
96
4.3.2 Number of Tardy Tasks
104
4.3.3 Mean Tardiness
109
4.3.4 Mean Earliness
113
4.4 Minimizing Change-Over Cost
114
4.4.1 Setup Scheduling
114
4.4.2 Lot Size Scheduling
117
4.5 Other Criteria
122
4.5.1 Maximum Cost
122
4.5.2 Total Cost
127
References
130
5 Scheduling on Parallel Processors
137
5.1 Minimizing Schedule Length
137
5.1.1 Identical Processors
137
5.1.2 Uniform and Unrelated Processors
158
5.2 Minimizing Mean Flow Time
168
5.2.1 Identical Processors
168
5.2.2 Uniform and Unrelated Processors
169
5.3 Minimizing Due Date Involving Criteria
173
5.3.1 Identical Processors
173
5.3.2 Uniform and Unrelated Processors
179
5.4 Other Models
182
5.4.1 Scheduling Imprecise Computations
182
5.4.2 Lot Size Scheduling
185
References
190
6 Communication Delays and Multiprocessor Tasks
199
6.1 Introductory Remarks
199
6.2 Scheduling Multiprocessor Tasks
205
6.2.1 Parallel Processors
205
6.2.2 Dedicated Processors
213
6.2.3 Refinement Scheduling
219
6.3 Scheduling Uniprocessor Tasks with Communication Delays
221
6.3.1 Scheduling without Task Duplication
222
6.3.2 Scheduling with Task Duplication
225
6.3.3 Scheduling in Processor Networks
226
6.4 Scheduling Divisible Tasks
228
References
236
7 Scheduling in Hard Real-Time Systems
243
7.1 Introduction
243
7.1.1 What is a Real-Time System?
244
7.1.2 Examples of Real-Time Systems
245
7.1.3 Characteristics of Real-Time Systems
246
7.1.4 Functional Requirements for Real-Time Systems
247
7.2 Basic Notations
248
7.2.1 Structure of a Real-Time System
248
7.2.2 The Task Model
249
7.2.3 Schedules
250
7.3 Single Processor Scheduling
252
7.3.1 Static Priority Rules
253
7.3.2 Dynamic Priority Scheduling
262
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.1.1 The Flow Shop Scheduling Problem
271
8.1.2 Complexity
273
8.2 Exact Methods
274
8.2.1 The Algorithms of Johnson and Akers
274
8.2.2 Dominance and Branching Rules
277
8.2.3 Lower Bounds
278
8.3 Approximation Algorithms
282
8.3.1 Priority Rule and Local Search Based Heuristics
282
8.3.2 Worst-Case Analysis
285
8.3.3 No Wait in Process
289
8.4 Scheduling Flexible Flow Shops
291
8.4.1 Problem Formulation
291
8.4.2 Heuristics and Their Performance
294
8.4.3 A Model
296
8.4.4 The Makespan Minimization Problem
297
8.4.5 The Mean Flow Time Problem
311
References
316
9 Open Shop Scheduling
321
9.1 Complexity Results
321
9.2 A Branch and Bound Algorithm for Open Shop Scheduling
323
9.2.1 The Disjunctive Model of the OSP
323
9.2.2 Constraint Propagation and the OSP
326
9.2.3 The Algorithm and Its Performance
332
References
341
10 Scheduling in Job Shops 345
10.1 Introduction
345
10.1.1 The Problem
345
10.1.2 Modeling
345
10.1.3 Complexity
348
10.1.4 The History
349
10.2 Exact Methods
352
10.2.1 Branch and Bound
353
10.2.2 Lower Bounds
353
10.2.3 Branching
355
10.2.4 Valid Inequalities
358
10.3 Approximation Algorithms
360
10.3.1 Priority Rules
360
10.3.2 The Shifting Bottleneck Heuristic
362
10.3.3 Opportunistic Scheduling
365
10.3.4 Local Search
367
10.4 Conclusions
387
References
388
11 Scheduling with Limited Processor Availability 397
11.1 Problem Definition
398
11.2 One Machine Problems
401
11.3 Parallel Machine Problems
403
11.3.1 Minimizing the Sum of Completion Times
403
11.3.2 Minimizing the Makespan
404
11.3.3 Dealing with Due Date Involving Criteria
412
11.4 Shop Problems
414
11.4.1 Flow Shop Problems
414
11.4.2 Open Shop Problems
417
11.5 Conclusions
417
References
419
12 Scheduling under Resource Constraints 425
12.1 Classical Model
425
12.2 Scheduling Multiprocessor Tasks
436
12.3 Scheduling with Continuous Resources
450
12.3.1 Introductory Remarks
451
12.3.2 Processing Speed vs. Resource Amount Model
452
12.3.3 Processing Time vs. Resource Amount Model
461
12.3.4 Ready Time vs. Resource Amount Model
466
References
471
13 Constraint Programming and Disjunctive Scheduling 477
13.1 Introduction
477
13.2 Constraint Satisfaction
479
13.2.1 The Constraint Satisfaction and Optimization Problem
479
13.2.2 Constraint Propagation
481
13.3 The Disjunctive Scheduling Problem
493
13.3.1 The Disjunctive Model
494
13.3.2 Solution Methods for the DSP
497
13.4 Constraint Propagation and the DSP
497
13.4.1 Some Basic Definitions
498
13.4.2 Precedence Consistency Tests
500
13.4.3 Lower-Level Bound-Consistency
500
13.4.4 Input/Output Consistency Tests
509
13.4.5 Input/Output Negation Consistency Tests
516
13.4.6 Input-or-Output Consistency Tests
522
13.4.7 Energetic Reasoning
523
13.4.8 Shaving
527
13.4.9 A Comparison of Disjunctive Consistency Tests
528
13.4.10 Precedence vs. Disjunctive Consistency Tests
530
13.5 Conclusions
530
13.6 Appendix: Bound Consistency Revisited
531
References
535
14 Scheduling in Flexible Manufacturing Systems 539
14.1 Introductory Remarks
539
14.2 Scheduling Dynamic Job Shops
542
14.2.1 Introductory Remarks
542
14.2.2 Heuristic Algorithm for the Static Problem
543
14.2.3 Computational Experiments
549
14.3 Simultaneous Scheduling and Routing in some FMS
550
14.3.1 Problem Formulation
550
14.3.2 Vehicle Scheduling for a Fixed Production Schedule
552
14.3.3 Simultaneous Job and Vehicle Scheduling
557
14.4 Batch Scheduling in Flexible Flow Shops under Resource Constraints
559
14.4.1 Introduction - Statement of the Problem
559
14.4.2 Mathematical Formulation
560
14.4.3 Heuristic Solution Approach
570
14.4.4 Implementation and Computational Experiment
577
References
579
15 Computer Integrated Production Scheduling 583
15.1 Scheduling in Computer Integrated Manufacturing
584
15.2 A Reference Model for Production Scheduling
589
15.3 IPS: An Intelligent Production Scheduling System
597
15.3.1 Interactive Scheduling
604
15.3.2 Knowledge-based Scheduling
619
15.3.3 Integrated Problem Solving
624
References
628
Index 631