Integrated Production, Control Systems: Management, Analysis, and DesignFocuses on the quantitative approaches necessary to computer-integrated manufacturing systems, and integrates major topics covering all phases of the production control cycle: production information processing and flow, production planning, forecasting, material requirements planning and monetary control, and scheduling. This new edition features a compendium set of 11 user-friendly computer programs for the IBM PC that enhance the teaching power of the text, allowing readers to solve real-life problems. Among programs included are growth forecasting, aggregate planning, material requirements planning, lot sizing and inventory control, and limited-resource scheduling. The chapters on scheduling give particularly thorough coverage on this difficult subject. Solutions are clearly presented, with many examples and exercises included in the text. |
From inside the book
Results 1-3 of 58
Page 259
... minimize some measure of lateness or tardiness as given by Equations 7.6 through 7.10 . Mean lateness for the simple n - task , one - processor problem is minimized by the SPT rule . THEOREM 7.3 The SPT Rule for Minimizing Mean Lateness ...
... minimize some measure of lateness or tardiness as given by Equations 7.6 through 7.10 . Mean lateness for the simple n - task , one - processor problem is minimized by the SPT rule . THEOREM 7.3 The SPT Rule for Minimizing Mean Lateness ...
Page 261
... minimize the number of tardy jobs . The EDD rule gives the desired schedule only if it results in zero or one tardy task . If more than one tardy task results , an algorithm attributed to Hodgson3 will yield the desired objective ...
... minimize the number of tardy jobs . The EDD rule gives the desired schedule only if it results in zero or one tardy task . If more than one tardy task results , an algorithm attributed to Hodgson3 will yield the desired objective ...
Page 291
... minimize turnaround time . How should the program loader feed the tasks to the computer ? 10. Referring to problem 9 , suppose the importance of the tasks fall into three categories , as given in Data Set B. What rule should the program ...
... minimize turnaround time . How should the program loader feed the tasks to the computer ? 10. Referring to problem 9 , suppose the importance of the tasks fall into three categories , as given in Data Set B. What rule should the program ...
Other editions - View all
Common terms and phrases
ACTIM activity aggregate planning algorithm allow analysis approach assembly assigned assumed BASICA batch BEGIN INVENTORY Box-Jenkins calculate carrying costs Chapter completion component considered constraints critical path cycle Data Set determine due date Equation error example problem exponential smoothing factors follows forecasted demand function function key Gantt chart given in Figure GROSS REQUIREMENTS Industrial Engineering input inventory control inventory costs inventory item inventory level KANBAN lead-time Line Balancing line-of-balance linear linear model machine makespan manufacturing master schedule MATERIAL REQUIREMENTS PLANNING maximum mean tardiness minimize minimum needed node operation optimal order costs order quantity output overtime parameters percent period personal computer procedure processor production control quadratic RECPT regression regression analysis resource safety stock sequence shift shown in Figure solution step storage Tandem Computers technique total cost units vendor week