Scheduling Computer and Manufacturing Processes

By: Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch

Write A Review

Hardcover | 1 June 2001 | Edition Number 2

At a Glance

Hardcover
500 Pages

Edition Type
Revised

Dimensions(cm)
24.77 x 16.51 x 3.18

Hardcover

$249.00

or 4 interest-free payments of $62.25 with

Ships in 5 to 7 business days

Let us first describe the purpose of this book, starting with the explanation of its title. In general, scheduling problems can be understood very broadly as the problems of allocating resources over time to perform a set of tasks being parts of some processes, among which computational and manufacturing ones are most important. Tasks individually compete for resources which can be of a very different nature, e.g. manpower, money, processors (machines), energy, tools. The same is true for task characteristics, e.g. ready times, due dates, relative ur- gency weights, functions describing task processing in relation to allotted re- sources. Moreover, a structure of a set of tasks, reflecting precedence constraints among them, can be defined in different ways. In addition, different criteria which measure the quality of the performance of a set of tasks can be taken into account. It is easy to imagine that scheduling problems understood so generally ap- pear almost everywhere in real-world situations. Of course, there are many as- pects concerning approaches for modeling and solving these problems which are of general methodological importance. On the other hand, however, some classes of scheduling problems have their own specificity which should be taken into ac- count. Since it is rather impossible to treat all these classes with the same atten- tion in a framework of one book, some constraints must be put on the subject area considered. In the case of this book these constraints are as follows.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

Introduction	p. 1
References	p. 6
Basics	p. 9
Sets and Relations	p. 9
Problems, Algorithms, Complexity	p. 11
Problems and Their Encoding	p. 11
Algorithms	p. 13
Complexity	p. 16
Graphs and Networks	p. 21
Basic Notions	p. 21
Special Classes of Digraphs	p. 22
Networks	p. 25
Enumerative Methods	p. 32
Dynamic Programming	p. 32
Branch and Bound	p. 33
Heuristic and Approximation Algorithms	p. 35
Approximation Algorithms	p. 35
Local Search Heuristics	p. 37
References	p. 51
Definition, Analysis and Classification of Scheduling Problems	p. 57
Definition of Scheduling Problems	p. 57
Analysis of Scheduling Problems and Algorithms	p. 62
Motivations for Deterministic Scheduling Problems	p. 65
Classification of Deterministic Scheduling Problems	p. 68
References	p. 71
Scheduling on One Processor	p. 73
Minimizing Schedule Length	p. 73
Scheduling with Release Times and Deadlines	p. 74
Scheduling with Release Times and Delivery Times	p. 81
Minimizing Mean Weighted Flow Time	p. 83
Minimizing Due Date Involving Criteria	p. 95
Maximum Lateness	p. 95
Number of Tardy Tasks	p. 104
Mean Tardiness	p. 109
Mean Earliness	p. 112
Minimizing Change-Over Cost	p. 113
Setup Scheduling	p. 113
Lot Size Scheduling	p. 116
Other Criteria	p. 121
Maximum Cost	p. 121
Total Cost	p. 126
References	p. 129
Scheduling on Parallel Processors	p. 137
Minimizing Schedule Length	p. 137
Identical Processors	p. 137
Uniform and Unrelated Processors	p. 157
Minimizing Mean Flow Time	p. 166
Identical Processors	p. 166
Uniform and Unrelated Processors	p. 168
Minimizing Due Date Involving Criteria	p. 171
Identical Processors	p. 171
Uniform and Unrelated Processors	p. 178
Other Models	p. 180
Semi-Identical Processors	p. 181
Scheduling Imprecise Computations	p. 189
Lot Size Scheduling	p. 192
References	p. 196
Communication Delays and Multiprocessor Tasks	p. 205
Introductory Remarks	p. 205
Scheduling Multiprocessor Tasks	p. 210
Parallel Processors	p. 210
Dedicated Processors	p. 218
Refinment scheduling	p. 224
Scheduling Uniprocessor Tasks with Communication Delays	p. 226
Scheduling without Task Duplication	p. 228
Scheduling with Task Duplication	p. 230
Scheduling in Processor Networks	p. 231
Scheduling Divisible Tasks	p. 233
References	p. 240
Scheduling in Flow and Open Shops	p. 247
Introduction	p. 247
The Flow Shop Scheduling Problem	p. 247
Complexity	p. 249
Exact Methods	p. 250
The algorithms of Johnson and Akers	p. 250
Dominance and Branching Rules	p. 253
Lower Bounds	p. 254
Approximation Algorithms	p. 259
Priority Rule and Local Search Based Heuristics	p. 259
Worst-Case Analysis	p. 262
No Wait in Process	p. 266
Open Shop Scheduling	p. 267
References	p. 269
Scheduling in Job Shops	p. 273
Introduction	p. 273
The Problem	p. 273
Modelling	p. 273
Complexity	p. 276
The History	p. 277
Exact Methods	p. 280
Branch and Bound	p. 280
Lower Bounds	p. 281
Branching	p. 282
Valid Inequalities	p. 286
Approximation Algorithms	p. 288
Priority Rules	p. 288
Opportunistic Scheduling	p. 293
Local Search	p. 294
Conclusions	p. 308
References	p. 308
Scheduling under Resource Constraints	p. 317
Classical Model	p. 317
Scheduling Multiprocessor Tasks	p. 328
Scheduling with Continuous Resources	p. 342
Introductory Remarks	p. 342
Processing Speed vs. Resource Amount Model	p. 344
Processing Time vs. Resource Amount Model	p. 353
Ready Time vs. Resource Amount Model	p. 358
References	p. 362
Scheduling in Flexible Manufacturing Systems	p. 367
Introductory Remarks	p. 367
Scheduling Flexible Flow Shops	p. 370
Problem Formulation	p. 370
Heuristics and their Performance	p. 371
Branch and Bound Algorithm	p. 373
Scheduling Dynamic Job Shops	p. 379
Introductory Remarks	p. 379
Heuristic Algorithm for the Static Problem	p. 380
Computational Experiments	p. 386
Simultaneous Scheduling and Routing in some FMS	p. 387
Problem Formulation	p. 387
Vehicle Scheduling for a Fixed Production Schedule	p. 389
Simultaneous Job and Vehicle Scheduling	p. 394
Batch Scheduling in Flexible Flow Shops under Resource Constraints	p. 396
Introduction - Statement of the Problem	p. 396
Mathematical Formulation	p. 398
Heuristic Solution Approach	p. 407
Implementation and Computational Experiment	p. 414
References	p. 415
Computer Integrated Production Scheduling	p. 421
Scheduling in Computer Integrated Manufacturing	p. 422
A Reference Model for Production Scheduling	p. 427
IPS: An Intelligent Production Scheduling System	p. 435
Interactive Scheduling	p. 442
Knowledge-Based Systems	p. 456
Integrated Problem Solving	p. 462
References	p. 466
Index	p. 469
Table of Contents provided by Publisher. All Rights Reserved.

Scheduling Computer and Manufacturing Processes

At a Glance

Hardcover

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Industrial Chemistry & Manufacturing Technologies

A Man and His Watch

Iconic Watches and Stories from the Men Who Wore Them

Baked to Perfection

Winner of the Fortnum & Mason Food and Drink Awards 2022

Mary Penfold

The true story of the great Australian winemaker, from the bestselling award-winning author of SISTER VIV and MR AND MRS GOULD

Meathead

The Science of Great Barbecue and Grilling

French Patisserie

Master Recipes and Techniques from the Ferrandi School of Culinary Arts

Professional Beauty Therapy

4th Edition - Australia and New Zealand

Longitude

The Food Lab

Better Home Cooking Through Science

Exactly

How Precision Engineers Created the Modern World

Ferment For Good

Ancient Foods for the Modern Gut: The Slowest Kind of Fast Food

The Art of Distilling : Revised and Updated

An Enthusiast's Guide to the Artisan Distilling of Whiskey, Vodka, Gin and other Potent Potables

Overcoming Synthetic Challenges in Medicinal Chemistry

Mechanistic Insights and Solutions

How To Brew

Everything You Need to Know to Brew Great Beer Every Time

The Forgotten Leg of Quality

Customer Service

The Forgotten Leg of Quality

Customer Service

Molecule and Ion Transport through Polymer Membranes

Better Not Burn Your Toast

The Science of Food and Health

The Science and Culture of Latin American Foods

Harnessing Ingredients for Health

The Everyday Blacksmith

Learn to Forge 55 Simple Projects You'll Use Every Day

Energy-Based Safety

A Scientific Approach to Preventing Serious Injuries and Fatalities (SIFs)

100 Iconic Watches

Preserving Food without Freezing or Canning

Traditional Techniques Using Salt, Oil, Sugar, Alcohol, Vinegar, Drying, Cold Storage, and Lactic Fermentation

Rare Watches

Explore the World's Most Exquisite Timepieces

Steels and High Entropy Alloys

Advances and Applications

This product is categorised by