Session wise Contents
1.2. Factors NOT considered in conventional MRP
1.3. Role of MRP in overall Manufacturing Planning Cotrol (MPC)
2.1.1. Measuring Capacity
2.1.2. Determination of available capacity
2.2. Capacity Expansion Strategy
2.3. Capacity Management
2.3.1. Capacity Planning Using Overall Factors (CPOF)
2.3.2. Capacity Bills
2.3.3. Resource Bills
2.4. Resource Planning
2.5. Rough-cut Capacity Planning
2.6. Capacity Requirement Planning
2.6.1. Benefits of CRP
2.6.2. Drawbacks of CRP
2.7. Scheduling Rules (Paper by Panwalker and Iskander)
2.8. Infinite versus and Finite Loading
2.9. Comparing the Strategies
3.1.1. Fixed Order Quantity (FOQ)
3.1.2. Economic Order Quantity (EOQ)
3.1.3. Lot-for-Lot (LFL)
3.1.4. Fixed Period Requirement (FPR)
3.1.5. Periodic Order Quantity (POQ)
3.1.6. Least Unit Cost (LUC)
3.1.7. Least Total Cost (LTC)
3.1.8. Part-Period Balancing (PPB)
3.1.9. Wagner-Whitin Algorithm (W-W Algorithm)
3.1.10. McLaren?’s Order Moment (MOM)
3.2. Analysis of Different Lot Sizing Heuristics
3.2.1. Outline of different heuristic methods
3.2.2. Analysis of EOQ
3.2.3. Analysis of W-W Method
3.2.4. The Groff (GR) Method
3.2.5. Silver Meal (SM) Method
3.2.6. Freeland-Colley Method
3.3. Determination of purchase Order Quantity
3.3.1. The purchasing discount problem
3.3.2. Buffering Concepts-Concept of Uncertainty, Safety Stock, Safety lead time
3.3.3. Safety stock and safety lead time performance comparison
4.2. Advanced Independent Ordering Systems
4.2.1.1. Service levels and Order Quantities
4.2.1.2. Total Cost Equation
4.2.1.3. Grid search procedure
4.2.1.4. The Iterative (Q, R) Procedure
4.2.2. Inventory and Transportation Mode Interaction
4.2.2.1. Total Cost Equation
4.2.2.2. Transport Mode Decision Example
4.2.2.3. Exact Methods
4.2.2.4. Heuristic Methods
4.2.3.2. Methods based on Group Reorder point
4.2.3.3. A group service level method
4.2.4. Multiple Criteria ABC Analysis
4.2.4.1. Multiple criteria ABC Analysis
4.2.4.2. Multiple criteria ABC Management Policies
5.2. Dynamic Scheduling approaches
5.3. One Machine/N-job case
5.4. Two-machine/N-job case
5.5. Three-machine/N-job case
5.6. Heuristics for M-machine/N-job case
5.7. Sequencing rules
5.8. Sequencing research results
5.9. Emerging issues in Scheduling
5.9.1. Cellular manufacturing systems
5.9.2. Scheduling manned cellular manufacturing systems
5.9.3. Scheduling FMS system
6.1.1. Linear Programming
6.1.2. Mixed Integer Programming
6.1.3. Heuristic approaches
6.2. Other approaches
6.2.1. The linear Decision Rule
6.2.2. The Management Co-efficient Model
6.2.3. Search Decision Rule
6.3. Disaggregation
6.3.1. The Disaggregation problem
6.3.2. Hierarchical production planning
6.3.3. Disaggregation through mathematical programming problem
6.4. Types of Production Planning and Control Systems
6.4.1. Pond-Draining System
6.4.2. Push System
6.4.3. Pull System
6.4.4. CONWIP System
6.4.5. DYNWIP System
6.5. Theory of Constraint (TOC)
6.5.1. Principles of TOC
6.5.2. TOC in Production Planning
7.1.1. Two-level MPS example
7.1.2. Booking Customer Order
7.1.3. Managing with Two-Level MPS
7.2. Additional Techniques
7.2.1. Alternative Available-To-Promise (ATP) explosion convention
7.2.2. Consumption by Actual Orders
7.2.3. Capacity Planning
7.3. Methods for construction planning BOM
Case study presentation by individual groups.
1) Mid Term (30 marks)
2) Case Presentation (20 Marks)
3) Class Patticipation (20 Marks)
4) End Term (30 Marks)
Created By: Debasis Mohanty on 08/10/2011 at 09:45 AM Category: PGDM-II Doctype: Document