Handbook of Scheduling
eBook - PDF

Handbook of Scheduling

Algorithms, Models, and Performance Analysis

  1. 1,224 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Handbook of Scheduling

Algorithms, Models, and Performance Analysis

About this book

This handbook provides full coverage of the most recent and advanced topics in scheduling, assembling researchers from all relevant disciplines to facilitate new insights. Presented in six parts, these experts provides introductory material, complete with tutorials and algorithms, then examine classical scheduling problems. Part 3 explores scheduling models that originate in areas such as computer science, operations research. The following section examines scheduling problems that arise in real-time systems. Part 5 discusses stochastic scheduling and queueing networks, and the final section discusses a range of applications in a variety of areas, from airlines to hospitals.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Handbook of Scheduling by Joseph Y-T. Leung in PDF and/or ePUB format, as well as other popular books in Business & Operations. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Chapman and Hall/CRC
Year
2004
Print ISBN
9781584883975
eBook ISBN
9780203489802
Edition
1
Topic
Business
Subtopic
Operations
Index
Business

Table of contents

  1. Front cover
  2. Dedication
  3. Preface
  4. The Editor
  5. Contributors
  6. Contents
  7. Part I: Introduction
  8. Chapter 1. Introduction and Notation
  9. Chapter 2. A Tutorial on Complexity
  10. Chapter 3. Some Basic Scheduling Algorithms
  11. Part II: Classical Scheduling Problems
  12. Chapter 4. Elimination Rules for Job-Shop Scheduling Problem: Overview and Extensions
  13. Chapter 5. Flexible Hybrid Flowshops
  14. Chapter 6. Open Shop Scheduling
  15. Chapter 7. Cycle Shop Scheduling
  16. Chapter 8. Reducibility among Scheduling Classes
  17. Chapter 9. Parallel Scheduling for Early Completion
  18. Chapter 10. Minimizing the Maximum Lateness
  19. Chapter 11. Approximation Algorithms for Minimizing Average Weighted Completion Time
  20. Chapter 12. Minimzing the Number of Tardy Jobs
  21. Chapter 13. Branch-and-Bound Algorithms for Total Weighted Tardiness
  22. Chapter 14. Scheduling Equal Processing Time Jobs
  23. Chapter 15. Online Scheduling
  24. Chapter 16. Convex Quadratic Relaxations in Scheduling
  25. Part III: Other Scheduling Models
  26. Chapter 17. The Master-Slave Scheduling Model
  27. Chapter 18. Scheduling in Bluetooth Networks
  28. Chapter 19. Fair Sequences
  29. Chapter 20. Due Date Quotation Models and Algorithms
  30. Chapter 21. Scheduling with Due Date Assignment
  31. Chapter 22. Machine Scheduling with Availability Constraints
  32. Chapter 23. Scheduling with Discrete Resource Constraints*
  33. Chapter 24. Scheduling with Resource Constraints-Continuous Resources
  34. Chapter 25. Scheduling Parallel Tasks - Algorithms and Complexity
  35. Chapter 26. Scheduling Parallel Tasks Approximation Algorithms
  36. Part IV: Real-Time Scheduling
  37. Chapter 27. The Pinwheel: A Real-Time Scheduling Problem
  38. Chapter 28. Scheduling Real-Time Tasks: Algorithms and Complexity*
  39. Chapter 29. Real-Time Synchronization Protocols
  40. Chapter 30. A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms
  41. Chapter 31. Fair Scheduling of Real-Time Tasks on Multiprocessors
  42. Chapter 32. Approximation Algorithms for Scheduling Time-Critical Jobs on Multiprocessor Systems
  43. Chapter 33. Scheduling Overloaded Real-Time Systems with Competitive/ Worst-Case Guarantees
  44. Chapter 34. Minimizing Total Weighted Error for Imprecise Computation Tasks and Related Problems
  45. Chapter 35. Dual Criteria Optimization Problems for Imprecise Computation Tasks
  46. Chapter 36. Periodic Reward-Based Scheduling and Its Application to Power-Aware Real-Time Systems
  47. Chapter 37. Routing Real-Time Messages on Networks
  48. Part V: Stochastic Scheduling and Queueing Networks
  49. Chapter 38. Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling: A Comparative Overview
  50. Chapter 39. Stochastic Scheduling with Earliness and Tardiness Penalties
  51. Chapter 40. Developments in Queueing Networks with Tractable Solutions
  52. Chapter 41. Scheduling in Secondary Storage Systems
  53. Chapter 42. Selfish Routing on the Internet
  54. Part VI: Applications
  55. Chapter 43. Scheduling of Flexible Resources in Professional Service Firms
  56. Chapter 44. Novel Methaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals
  57. Chapter 45. University Timetabling
  58. Chapter 46. Adapting the GATES Architecture to Scheduling Faculty
  59. Chapter 47. Constraint Programming for Scheduling
  60. Chapter 48. Batch Production Scheduling in the Process Industries
  61. Chapter 49. A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem
  62. Chapter 50. Scheduling Problems in the Airline Industry
  63. Chapter 51. Bus and Train Driver Scheduling
  64. Chapter 52. Sports Scheduling
  65. Index
  66. Back cover