Production planning and industrial scheduling: examples, case studies, and applications

Contents 1. Introduction to scheduling 1.1 Production Planning Production Systems Response Time Supply Chain Inventory 1.2 Scheduling Scheduling examples Scheduling on shop floor What is included in the following chapters? What is not included I the following chapters 1.3 Summary Problems References and Suggested Readings 2. Plant Locations and Capacity Determination 2.1 Existing Production Facilities Distribution Network with Existing Facilities Response Time Consideration Limitation on Number of Facilities 2.2 New Plant Locations New Facility with Capacity Determination Single Sourcing Time Constraints 2.3 Uncertainty in Demand Large Plant Evaluation Small Plant Evaluation Expansion in the Future 2.4 Summary Problems References and Suggested Readings 3. Forecasting and Aggregate Planning 3.1 Forecasting Qualitative Forecasting Quantitative Forecasting Static Forecasting Adaptive Forecasting Exponential Smoothing Holts and Winter¿s Model Analysis of Forecasting Errors 3.2 Aggregate Planning Strategies Other Factors Spread Sheet Approach 3.3 Summary Problems References and Suggested Readings 4. Master Production Scheduling and Materials Requirement Planning 4.1 Master Production Schedule Fixed Order Quantity (FOQ) Periodic Order Quantity (POQ) Lot for Lot (L4L) Least Total Cost (LTC) Incremental Cost Analysis (ICA) Available To Promise (ATP) Chart Concluding Remarks on MPS 4.2 Material Requirement Planning (MRP) and Other Techniques Least Unit Cost Purchase Policy (LUC) General Considerations Manufacturing Resource Planning Enterprise Resource Planning Distribution Requirement Planning (DRP) 4.3 Summary Problems References and Suggested Readings 5. Inventory and Capacity Planning 5.1 Inventory Planning Economic Order Quantity (EOQ) 5.2 Safety Stock Determination Fixed Order Quantity -Varying Cycle System Periodic Review System Safety Stock With Substitute Products 5.3 Quantity Discount All Unit Quantity Discount Marginal Unit Quantity Discount One Time Unit Price Discount Multiple Products Order Jointly 5.4 Single Period Planning Discrete Order Quantity Single Period Ordering with Continuous Demand Buy-Back Policy Effect of Reduction in s 5.5 Consumption During Production 5.6 JIT Inventory System 5.7 Resource Center Capacity Planning Rough Cut Planning Capacity Bills Number of Machines Needed 5.8 Theory of Constraints 5.9 Summary Problems References and Suggested Readings 6. A Single machine scheduling 6.1 The Tardiness Problem 6.2 A Survey of Exact Methods for The Single Machine Scheduling Problem. 6.3 Commonly Used Heuristic Rules. 6.4 Description of The Backward Forward Heuristic. 6.5 A Single Machine Problem with Early and Late Penalties. 6.6 Some Well Known Theorems 6.7 Summary. Problems References and Suggested Readings 7. Other objectives in single machine scheduling. 7.1 Common Due Date. 7.2 Common Due Date Specified by a Customer. 7.3 Early and Late Due Dates. 7.4 Quadratic or Non Linear Penalty Function 7.5 Minimization of The Average Delay 7.6 Minimization of The Maximum Delay. 7.7 Minimizing The Number of Jobs That Are Delayed. 7.8 Maximizing the Number of Jobs Delayed When The Available Time is Less Than Total Processing Time. 7.9 Sequence-Dependent Jobs. 7.10 Sequence-Dependent Jobs with Minimum or Maximum Separations. 7.11 Minimize Variation of Flow Time. 7.12 Sequence-Dependent Setup Times. 7.13 Dual Criteria. 7.14 Delay of Early-Completing Jobs. 7.15 Jobs Arriving at Different Times. 7.16 Summary. Problems References and Suggested Readings 8. Flowshop problems. 8.1 Two Machine Problem. 8.2 Three Machine Problem. 8.3 Setup/Processing and Removal Times Separated: Another Extension of Johnson¿s Algorithm 8.4 Two Machine Flow Shop with Travel Time between Machines. 8.5 The n-Job/m-Machine Problem. 8.6 The n-Job/m-Machine Problem with Jobs Arriving at Different Times. 8.7 Summary Problems References and Suggested Readings 9. Parallel Processing and batch sequencing 9.1 Parallel Processing. 9.2 Single Operation Job Related Earliness/ Tardiness Penalties with Machine Activation Cost 9.3 Non Identical Parallel Processors. 9.4 Parallel Machines in a Flow Shop 9.5 Batch Scheduling for a Limited Capacity, Fixed- Period Process Problem. 9.6 Batch Scheduling for Limited Capacity Processors in Sequence with Varying Job Requirements. 9.7 Batch Sequencing. 9.8 Summary Problems References and Suggested Readings 10. Network-Based Scheduling. 10.1 Critical Path Method. 10.2 To Schedule a Network of Jobs on a Specified Number of Parallel Processors. 10.3 A Variation of The Parallel Machine Problem. 10.4 Assembly Line Balancing. 10.5 Mixed-Model Assembly (MMA) Line Balancing. 10.6 MMA- Method to Minimize Stations 10.7 Network Scheduling with Resource Constraint. 10.8 Summary Problems References and Suggested Readings 11. Job shop scheduling 11.1 Job Shop 11.2 Job Shop Scheduling to Minimize Makespan (SPT). 11.3 Network Approach to Job Shop Scheduling. 11.4 Job Shop Scheduling to Minimize Tardiness. 11.5 Summary Problems References and Suggested Readings 12. Open shop scheduling. 12.1 Minimizing Makespan: Two-Machine problem. 12.2 Minimizing Makespan: Multiple-Machine Problem. 12.3 Minimization of Total Tardiness-Open Shop (MTT-OP) 12.4 Minimization of Total Weighted Tardiness Penalties-Open Shop (MTWT-OP) 12.5 Summary Problems References and Suggested Readings 13. Manpower Scheduling 13.1 Consecutive Days off Scheduling. 13.2 Rotating Days(Weekends) off 13.3 Monroe¿s Algorithm. 13.4 Tour Scheduling. 13.5 Three Consecutive Days off 13.6 Summary. Problems References and Suggested Readings 14. Industrial Sequencing I: Tool scheduling on NC machines 14.1 Tabular Approach in Group Forming 14.2 Job Sequencing to Minimize Tool Changeovers in Flexible Manufacturing Systems. 14.3 Heuristic to Minimize Throughput Time on a Numerically Controlled (NC) Machine. 14.4 Summary. Problems References and Suggested Readings 15. Industrial Sequencing II: Electronic¿Component tape assemblies on a sequencer 15.1 A Heuristic Procedure for Tape Assembling on a Sequencer. Problem Description Solution Procedure 15.2 Summary. Problems References and Suggested Readings 16. Industrial Sequencing III: Sequencing feeder for component tape assembly. 16.1 Problem Description. 16.2 Heuristic Procedure. 16.3 Validity and Comments. 16.4 Summary. Problems References and Suggested Readings 17. Industrial Scheduling IV: Scheduling in Flexible Manufacturing 17.1 A CDS based two-phase algorithm for group scheduling with group dependent setup times. 17.2 Multiple Robot in Assembly Operation. Problems References and Suggested Readings.

Revised edition of: Industrial scheduling. 1997. <br>Includes bibliographical references and index.