Theory of Scheduling (Dover Books on Computer Science),Used

Theory of Scheduling (Dover Books on Computer Science),Used

In Stock
SKU: SONG0486428176
UPC: 9780486428178
Brand: Dover Publications
Condition: Used
Regular price$22.82
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

This comprehensive text explores the mathematical models underlying the theory of scheduling. Organized according to scheduling problem type, it examines three solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer. Topics include problems of sequence, measures for schedule evaluation, finite sequencing for a single machine, and further problems with one operation per job. Additional chapters cover flowshop scheduling, the general n/m jobshop problem, general network problems related to scheduling, selection disciplines in a singleserver queuing system, singleserver queuing systems with setup classes, multipleserver queuing models, and experimental investigation of the continuous jobshop process. 1967 edition.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

  • Q: How many pages does this book have? A: This book has three hundred four pages. It provides a comprehensive exploration of scheduling theory.
  • Q: What are the dimensions of this book? A: The book measures six point fourteen inches in length, zero point sixty-one inches in width, and eight point nine inches in height.
  • Q: What is the binding type of this book? A: This book is a paperback edition. It offers a flexible and lightweight format for reading.
  • Q: Who is the author of this book? A: The author of the book is Richard W. Conway. He is known for his contributions to scheduling and operations research.
  • Q: What topics does this book cover? A: This book covers various topics in scheduling, including algebraic techniques, probabilistic methods, and Monte Carlo simulation.
  • Q: Is this book suitable for beginners? A: Yes, this book is suitable for beginners. It organizes content based on scheduling problem types, making it accessible.
  • Q: What problem types are explored in this book? A: The book examines scheduling problems such as flow-shop scheduling and the n/m job-shop problem.
  • Q: Can I use this book for academic studies? A: Yes, this book is suitable for academic studies. It provides in-depth analysis and mathematical models relevant to scheduling.
  • Q: Is this book appropriate for children? A: No, this book is not specifically appropriate for children. It is aimed at readers interested in computer science and management.
  • Q: How should I store this book? A: Store this book in a cool, dry place away from direct sunlight. This helps preserve its condition and longevity.
  • Q: Can I clean this book if it gets dirty? A: Yes, you can gently wipe the cover with a dry cloth. Avoid using liquids that may damage the pages.
  • Q: What if the book arrives damaged? A: If the book arrives damaged, contact the seller for return or replacement options. Most sellers offer satisfaction guarantees.
  • Q: Is there a warranty for this book? A: No, books typically do not come with a warranty. However, check with the seller for their return policy.
  • Q: Can I gift this book? A: Yes, this book makes a great gift for anyone interested in scheduling and operations research.
  • Q: Does this book include illustrations or diagrams? A: The product details do not specify illustrations or diagrams. It focuses more on mathematical models and theories.

Recently Viewed