(For People Who Really Have to Do It)
Volume I in the Useful Management Series
By Robert E.D. (Gene) Woolsey, Ph.D., F.I.D.S.
with Ruth Maurer, Ph.D.
Pages: 72
PDF Price: $12.00
Print Price: $16.00 (Plus Shipping & Handling)
"Production Scheduling (For People Who Really Have to Do It)" is a cookbook of quick and dirty methods for solving problems in real-world, no-nonsense production scheduling.
Written by Robert E.D. (Gene) Woolsey, Ph.D., F.I.D.S., with Ruth Maurer, Ph.D., the book is aimed at bottom- to middle-level managers, management in third-world countries, and small businesses where computers are either too expensive or labor is too cheap or too uneducated to justify anything but the use of common sense.
The authors discuss several methods of production scheduling. At the end of each method there is a "political discussion" covering the political good news and bad news a person might run into when using that particular method. Every other chapter is a political chapter. These chapters discuss political realities with guidance and/or one or more war stories of application or misapplication of the previously covered techniques for the amusement and edification of the user.
This book is dedicated to the idea that if you don't deal with the political problems as well as you deal with the technical problems, the political problems will deal with YOU!
| Author Biographies: Gene Woolsey is the director of the Management Science/Operations Research Program at the Colorado School of Mines. He is past elected International President of the Institute of Management Sciences. He is the first recipient of the Harold Larnder Prize for Distinguished International Achievement in Operations Research. He was formerly the editor of the Production and Inventory Management Journal (72,000 circulation in 125 countries). He also holds teaching positions at seven other universities in four countries. For the past decade, he has worked Pro Bono for any government agency of any government of sufficiently conservative, capitalist form with which he politically agrees. For this work he was decorated by the government of Israel and holds the Distinguished Civilian Service Medal of the United States. Ruth Maurer is associate professor of mathematics (Operations Research/Applied Probability) at the Colorado School of Mines. She is former mayor of the city of Golden. She was the consulting energy economist for the First Interstate Bank of Denver and was visiting professor of engineering at the United States Military Academy at West Point. For her Pro Bono consulting work for the Department of the Army, she was awarded the Outstanding Civilian Service Medal and the Commander's Medal. She led the effort to implement emergency telephone service in Jefferson County. |
Table of Contents
Preface: Questions and Answers About this Book
Chapter 1. Quick and Dirty Multiple Process Scheduling
• The Beginning: The Two-Machine Job Shop• Three-Machine Job Shop (With Dominance)• M-Machine Job Shop, Gupta's Method• Two-Machine Job Shop with Technological Ordering• M-Machine Job Shop with Technological Ordering• Synopsis• References• Quick and Dirty Methods for Multiple Process Scheduling I• Quick and Dirty Methods for Multiple Process Scheduling II• Multiple Process Scheduling Practice Problems I• Multiple Process Scheduling Practice Problems IIChapter 2. Obtaining Data You Can Trust
• Time and Motion Studies and Other Amusements• Example of a Company Doing It Dead Wrong• Example of a Company That Is Still Learning• Example of a Company Doing It Dead RightChapter 3. Quick and Dirty Single Process Scheduling
• The Beginning: Treating The Shop As A Single Process• Minimizing the Average Completion Time; Minimizing The Average Flow Time; Minimizing The Average Waiting Time• Minimizing the Maximum Tardiness• Maximizing the Minimum Tardiness • Minimizing the Number of Late Jobs• Van Drew's Chart• Minimizing the Average Completion Time with Priority; Minimizing the Average Flow Time with Priority; Minimizing the Average Waiting Time with Priority• Reducing Maximum Tardiness with Priority• Increasing Minimum Tardiness with Priority• Reducing the Average Completion Time with Precedence;Reducing the Average Flow Time with Precedence; Reducing the Average Waiting Time with Precedence• Minimizing Maximum Tardiness with Precedence• Maximizing Minimum Tardiness with Precedence• Minimizing Set-Up, Tear-down Time on One Process• References• Quick and Dirty Methods For Single Process Scheduling I• Quick and Dirty Methods For Single Process Scheduling II• Single Process Scheduling Practice Problems I• Single Process Scheduling Practice Problems II• Single Process Scheduling Practice Problems IIIChapter 4. Survival Scheduling with Hodgson's Rule
or See How Those Salesmen Love One Another
• Hodgson's Rule• ReferencesChapter 5. Quick and Dirty Parallel Machine Scheduling
• The Beginning: Bedworth & Bailey's Methods• Method 1: Minimizing Mean Flow Time on M Parallel Machines• Method 2: Reducing Makespan and Mean Flow Time on M Parallel Machines• Method 3: Reducing Maximum Tardiness on M Parallel Machines• Method 4: Reducing Tardiness on M Parallel Machines• Method 5: Reducing Number of Late jobs on M Parallel Machines• Final Comments• References• Quick and Dirty Methods For Parallel Process Scheduling I• Parallel Process Scheduling Practice Problems I• Parallel Process Scheduling Practice Problems IIChapter 6. Scheduling in the Real World, Final Warnings
• Multiple Process Politics• Single Process Politics• Parallel Process Politics• (Computer) Systems and Politics• Final Words: Fredrick Taylor was Right• Getting System Acceptance• ReferenceChapter 7. On System Acceptance
• Homework• The Beginning• The Middle• The EndOrdering:
If you would like to order print copies of this book or order more than one title as a PDF file go to the e-books shopping cart form.
If you would like to order a PDF of Production Scheduling (For People Who Really Have to Do It): Volume I in the Useful Management Series only, click here for credit card payments and automatic download.
PLEASE NOTE: Ordering single PDFs is more expediant than ordering mutiple titles at once. Single PDF orders are automated. A username and password for download access will be automatically e-mailed to you as soon as your payment is approved. Orders of multiple e-books are handled partially by hand and can take up to 12 business hours to process.
If you would like to order mutiple e-book titles, yet still benefit from our automated processing simply place orders, and return to the e-books order form to order other titles.
Click here to learn about our other E-book titles.
Web Site � Copyright 2020 by Lionheart Publishing, Inc.
All rights reserved.
Lionheart Publishing, Inc.
34 Hillside Ave
Phone: +44 23 8110 3411 |
E-mail:
Web: www.lionheartpub.com
