Scheduling in Computer and Manufacturing Systems
Our rough guess is there are 77,750 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 11 minutes to read. With a half hour per day, this will take 11 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Ecker, Klaus - Contributor
- Schmidt, Günter - Contributor
- Wȩglarz, Jan - Contributor
Publication
1993 - Springer Berlin Heidelberg, Berlin, Heidelberg, Germany
Language
English
Word Count
77,750 words, Guess
Page Count
311 pages
Physical Format
Electronic resource
Identifiers
- Internet Archiveschedulingcomput00blaz
- ISBN-103662000768
- ISBN-103662000741
- ISBN-139783662000762
- ISBN-139783662000748
and 3 more
- OCLC Control Number851369197
- Better World Books9783662000748
- Open LibraryOL27086405M
Classifications
- DDC650
- LCCHF54.5-54.56
Description
The book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. In such systems processors (machines) and possibly other resources are to be allocated among tasks in such a way that certain scheduling objectives are met. Various scheduling problems are discussedwhere different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factors are involved. Most important classical results are surveyed, with particular attention paid to single-processor scheduling.Then more general models are studied, including parallel processors, resource-constrained scheduling, flexible flow shops, dynamic job shops, andflexible manufacturing systems. For the presentation of algorithms a Pascal-like notation is chosen and used in almost all cases. For the convenience of less advanced readers, basic concepts from scheduling theory and related areas (e. g. computational complexity anlaysis) are included.
Other Editions
- Scheduling in Computer and Manufacturing Systems
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!