Production Scheduling (For People Who Really Have to Do It)

<body bgcolor="#ffffff" link="#cc0000" vlink="#cc0000" background="../ebooks/art/bakwhite.gif"> <img src="../ebooks/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> <table border="0" cellspacing="0" cellpadding="0" width="465"><tr valign="top"> <td width="15"> </td> <td width="450"><font face="verdana, arial, helvetica" size="2"> <font face="verdana, arial, helvetica" size="4"><b>Production Scheduling<br> (For People Who Really Have to Do It)<br> Volume I in the Useful Management Series</b></font><br><img src="../ebooks/art/sched-cover.jpg" width="191" height="247" hspace="2" vspace="2" align="Right" border="0" alt="Cover illustration "> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> <font face="verdana, arial, helvetica" size="3">By Robert E.D. (Gene) Woolsey, Ph.D., F.I.D.S.<br> with Ruth Maurer, Ph.D. </font><br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> <b>Pages: 72</b><br> <b>PDF Price: $12.00</b><br> <b>Print Price: $16.00 (Plus Shipping & Handling)</b><br> <a href="#order"><img src="../ebooks/art/order.gif" width="116" height="19" hspace="0" vspace="4" border="0" alt="Order Button"></a><br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> <br> "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.<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="8" border="0"><br> 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.<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="8" border="0"><br> 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.<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="8" border="0"><br> 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!<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="8" border="0"><br> <table border="0" cellspacing="0" cellpadding="6" bgcolor="#CECECE"> <tr> <td><font face="verdana, arial, helvetica" size="2"><b>Author Biographies:</b><br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> <b>Gene Woolsey</b> 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 <i>Production and Inventory Management Journal</i> (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. <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="8" border="0"><br> <b>Ruth Maurer</b> 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.<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"></td> </tr> </table> <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> <b>Table of Contents</b><br> <b>Preface:</b> Questions and Answers About this Book<br> <b>Chapter 1.</b> Quick and Dirty Multiple Process Scheduling<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> The Beginning: The Two-Machine Job Shop<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Three-Machine Job Shop (With Dominance)<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> M-Machine Job Shop, Gupta's Method<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Two-Machine Job Shop with Technological Ordering<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> M-Machine Job Shop with Technological Ordering<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Synopsis<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> References<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Quick and Dirty Methods for Multiple Process Scheduling I<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Quick and Dirty Methods for Multiple Process Scheduling II<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Multiple Process Scheduling Practice Problems I<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Multiple Process Scheduling Practice Problems II<br> <b>Chapter 2.</b> Obtaining Data You Can Trust<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Time and Motion Studies and Other Amusements<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Example of a Company Doing It Dead Wrong<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Example of a Company That Is Still Learning<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Example of a Company Doing It Dead Right<br> <b>Chapter 3.</b> Quick and Dirty Single Process Scheduling<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> The Beginning: Treating The Shop As A Single Process<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Minimizing the Average Completion Time; <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0">Minimizing The Average Flow Time; Minimizing The Average Waiting Time<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Minimizing the Maximum Tardiness<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Maximizing the Minimum Tardiness <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Minimizing the Number of Late Jobs<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Van Drew's Chart<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Minimizing the Average Completion Time with Priority; <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0">Minimizing the Average Flow Time with Priority; <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0">Minimizing the Average Waiting Time with Priority<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Reducing Maximum Tardiness with Priority<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Increasing Minimum Tardiness with Priority<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Reducing the Average Completion Time with Precedence;<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0">Reducing the Average Flow Time with Precedence; <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0">Reducing the Average Waiting Time with Precedence<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Minimizing Maximum Tardiness with Precedence<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Maximizing Minimum Tardiness with Precedence<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Minimizing Set-Up, Tear-down Time on One Process<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> References<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Quick and Dirty Methods For Single Process Scheduling I<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Quick and Dirty Methods For Single Process Scheduling II<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Single Process Scheduling Practice Problems I<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Single Process Scheduling Practice Problems II<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Single Process Scheduling Practice Problems III<br> <b>Chapter 4.</b> Survival Scheduling with Hodgson's Rule<br> or See How Those Salesmen Love One Another<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Hodgson's Rule<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> References<br> <b>Chapter 5.</b> Quick and Dirty Parallel Machine Scheduling<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> The Beginning: Bedworth & Bailey's Methods<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Method 1: Minimizing Mean Flow Time on M Parallel Machines<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Method 2: Reducing Makespan and Mean Flow Time on M Parallel Machines<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Method 3: Reducing Maximum Tardiness on M Parallel Machines<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Method 4: Reducing Tardiness on M Parallel Machines<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Method 5: Reducing Number of Late jobs on M Parallel Machines<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Final Comments<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> References<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Quick and Dirty Methods For Parallel Process Scheduling I<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Parallel Process Scheduling Practice Problems I<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Parallel Process Scheduling Practice Problems II<br> <b>Chapter 6.</b> Scheduling in the Real World, Final Warnings<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Multiple Process Politics<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Single Process Politics<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Parallel Process Politics<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> (Computer) Systems and Politics<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Final Words: Fredrick Taylor was Right<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Getting System Acceptance<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Reference<br> <b>Chapter 7.</b> On System Acceptance<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> Homework<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> The Beginning<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> The Middle<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" hspace="12" border="0"> The End<br> <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="8" border="0"><br> <a name="order"></a> <font face="verdana, arial, helvetica" size="3"><b>Ordering:</b><br></font> If you would like to order print copies of this book or order more than one title as a PDF file go to the <a href="/forms/ebooksorder2.html" target="_top">e-books shopping cart form</a>. <br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> If you would like to order a PDF of <b>Production Scheduling (For People Who Really Have to Do It): Volume I in the Useful Management Series</b> only, <a href="https://www5.atsbank.com/cgi-bin/atsmem.exe?1000&27103+ebsch" target="_top">click here for credit card payments</a> or <a href="https://www5.atsbank.com/cgi-bin/atsmem.exe?1001&27103+ebsch" target="_top">here for electronic checking</a>.<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> <b>PLEASE NOTE:</b> 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.<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="4" border="0"><br> If you would like to order mutiple e-book titles, yet still benefit from our automated processing simply place orders, and return to the <a href="/forms/ebooksorder2.html" target="_top">e-books order form</a> to order other titles.<br> <img src="../ebooks/art/cleardot.gif" width="1" height="1" vspace="8" border="0"><br> Click here to learn about our other <a href="/ebooks/ebooksmain.html">E-book titles</a>.<br>  <img src="../ebooks/cleardot.gif" width="1" height="1" vspace="16" border="0"><br> <img src="../ancill/art/lpimainbarblue.gif" width="450" height="1" border="0"><br> Web Site � Copyright 2020 by Lionheart Publishing, Inc.<br> All rights reserved.<br> <img src="../ebooks/cleardot.gif" width="1" height="1" vspace="1" border="0"><br> <img src="../ancill/art/lpibargrey.gif" border="0" height="1" width="450"><br> <img src="../ebooks/cleardot.gif" width="1" height="1" vspace="1" border="0"><br> <font face="verdana, arial, helvetica" size="2"> <font color="#003366" size="3"><b>Lionheart Publishing, Inc.</b></font><br> 2555 Cumberland Parkway, Suite 299, Atlanta, GA 30339 USA<br> Phone: +44 23 8110 3411 | <br> E-mail: <br> Web: <a href="/" target="_top">www.lionheartpub.com</a><br> </td></tr></table> <img src="../ebooks/cleardot.gif" width="1" height="1" vspace="3" border="0"><br> </body>