Industrial SchedulingINDUSTRIAL SCHEDULING is a short, handy guide to the broad spectrum of problems that students and practitioners in the manufacturing and service industries encounter in the workplace. The models used accurately represent situations encountered in the working world. This book makes solutions to scheduling problems easy to understand, adapt, and use. Instead of concentrating on highly complex mathematical techniques, Sule's book applies practical, heuristic approaches to planning and prioritizing resources for maximum efficiency and profitability. Concise coverage emphasizes useful cases and examples with real systems and allows the book to be used as a text or companion guide in a variety of curricula, including engineering, business, and quantitative methods programs. |
Common terms and phrases
activity algorithm assembly line assign job assigned to machine associated Batch best sequence branch and bound calculated candidate jobs cessing column completion component type cost critical job cycle delay develop a schedule early and late example Figure following message appears forward phase Gantt chart go to step heuristic idle Iteration Job 3 Job job number job schedule job sequence job shop Johnson's algorithm largest processing late penalties loading Machine Machine Machine Machine Sequence maximum milling machine minimize the makespan minimum node number of jobs Operations Research Optimal sequence optimum option output oven penalty value planning table position priority processors production select job Sequence to examine setup shown in Table solution tardiness penalty task TMA-next tool changes total number total penalty total processing turret units user is prompted user responds user should respond weekend workers