Mpc sequencing
Download as PPTX, PDF3 likes903 views
The document discusses sequencing methods for scheduling jobs at work centers. It describes sequencing as determining the order of jobs processing and mentions common priority rules like first-come, first-served. It also covers the Johnson's rule for sequencing jobs across two machines to minimize completion time and provides an example of applying the rule.
Mpc sequencing
- 1. SEQUENCING - PORAS SANCHETI 201051 - DEEPAK MALCHE 200932
- 2. What is Sequencing..?? Sequencing: Determine the order in which jobs at a work center will be processed. Requires order for sequencing at all work centers as well as sequencing at individual work centers. Workstation: An area where one person works, usually with special equipment, on a specialized job. Job time: Time needed for setup and processing of a job. Job Flow Time: The length of time a job is in the shop at a particular workstation or work center. Job Lateness: This is the length of time the job completion date is expected to exceed the date the job was due or promised to a customer.
- 3. PRODUCTION AND OPERATIONS MANAGEMENT Makespan: This is the total time needed to complete a group of jobs. It is the length of time between the start of the first job in the group and the completion of the last job in the group. Average Number of Jobs: Jobs that are considered in a shop are considered to be work in process inventory. Mathematically, Average Number of Jobs= Total Flow Time / Makespan
- 4. Priority Rules FCFS - First Come, First Served: Jobs are processed in the order in which they arrive at a machine or work center. SPT-Shortest Processing Time: Jobs are processed according to p rocessing time at a machine or work center, shortest job first. DD - Due Date: Jobs are processed according to due date, earliest due date first. CR - Critical Ratio: Jobs are processed according to smallest ratio of time remaining until due date to processing time remaining.
- 5. S/O - Slack Per Operation: Jobs are processed according to average slack time (time until due date minus remaining time to process). Compute by dividing slack time by dividing slack time by number of remaining operations including the current one.
- 6. ASSUMPTIONS TO PRIORITY RULE S The set of jobs is known, no new jobs arrive after processing begins and no jobs are canceled. Setup time is deterministic There will be no interruptions in processing such as machine breakdowns, accidents or worker illnesses.
- 7. FACTORS AFFECTING SCHEDULING A. Setup Times B. Processing Times C. Changes in the set of jobs. D. Breakdown Consequences. I. Production capacity is reduced : Orders are delayed. II. No production: Overhead continues. III. Cost per unit increases: Quality issues. IV. Product may be damaged. V. Safety issues. 1. Injury to employees 2. Injury to customers
- 8. OPERATIONS STRATEGY Scheduling can hinder or help the Operations Strategy. An on time delivery of a product or service is only possible if the Operations Managers is able to do effective scheduling. An ineffective scheduling would result in inefficient use of resou rces and possible dissatisfied customers. Scheduling as an operations strategy can provide an organization a competitive advantage over its competitors. Time based competition depends on good scheduling.
- 9. TYPES OF SEQUENCING ‘n’ Jobs and 1 Machine. ‘n’ Jobs and 2 Machine. ‘n’ Jobs and 3 Machine. 1 Jobs and ‘m’ Machine. 2 Jobs and ‘m’ Machine.
- 10. Two Resource Problems ( ‘n’ Jobs and 2 Machines) Suppose you work with a classmate, Kim on multiple projects. In each project you do the research, and Kim writes the report You want to complete all projects as soon as possible. 2 6 3 5 1 4 3 5 4 2 Processing time (you): Processing time (Kim): What should be the order for the projects?
- 11. Two Resource Problems Johnson’s Rule Sequences tasks to minimize makespan 1. Find the smallest processing time. • If its on the 1st machine, assign the task at the beginning of the sequence and eliminate it from further consideration. • If its on the 2nd machine, assign the task at the end of the sequence and eliminate it from further consideration 2. Repeat step 1 for all unassigned tasks 2 6 3 5 1 4 3 5 4 2 Processing time (you): Processing time (Kim): What order should you do the projects in?
- 12. Two Resource Problems Johnson’s Rule Sequences tasks to minimize makespan 2 6 3 5 1 4 3 5 4 2 Processing time (you): Processing time (Kim): Sequence English 1. Find the smallest processing time. • If its on the 1st machine, assign the task at the beginning of the sequence and eliminate it from further consideration. • If its on the 2nd machine, assign the task at the end of the sequence and eliminate it from further consideration 2. Repeat step 1 for all unassigned tasks
- 13. Two Resource Problems Johnson’s Rule Sequences tasks to minimize makespan Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequence English Management 1. Find the smallest processing time. • If its on the 1st machine, assign the task at the beginning of the sequence and eliminate it from further consideration. • If its on the 2nd machine, assign the task at the end of the sequence and eliminate it from further consideration 2. Repeat step 1 for all unassigned tasks
- 14. Two Resource Problems Johnson’s Rule Sequences tasks to minimize makespan Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequence English Management Finance 1. Find the smallest processing time. • If its on the 1st machine, assign the task at the beginning of the sequence and eliminate it from further consideration. • If its on the 2nd machine, assign the task at the end of the sequence and eliminate it from further consideration 2. Repeat step 1 for all unassigned tasks
- 15. Johnson’s Rule Sequences tasks to minimize makespan Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequence Marketing 1. Find the smallest processing time. • If its on the 1st machine, assign the task at the beginning of the sequence and eliminate it from further consideration. • If its on the 2nd machine, assign the task at the end of the sequence and eliminate it from further consideration 2. Repeat step 1 for all unassigned tasks English Management Finance Two Resource Problems
- 16. Two Resource Problems Johnson’s Rule Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan 1. Find the smallest processing time. • If its on the 1st machine, assign the task at the beginning of the sequence and eliminate it from further consideration. • If its on the 2nd machine, assign the task at the end of the sequence and eliminate it from further consideration 2. Repeat step 1 for all unassigned tasks SEQUENCE English Management Finance Accounting Marketing
- 17. Two Resource Problems Johnson’s Rule You Kim Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan SEQUENCE English Management Finance Accounting Marketing
- 18. Two Resource Problems Johnson’s Rule You Kim Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan SEQUENCE English Management Finance Accounting Marketing
- 19. Two Resource Problems Johnson’s Rule You Kim Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan SEQUENCE English Management Finance Accounting Marketing
- 20. Two resource problems Two Resource Problems Johnson’s Rule You Kim Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan SEQUENCE English Management Finance Accounting Marketing
- 21. Two resource problems Two Resource Problems Johnson’s Rule You Kim Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan SEQUENCE English Management Finance Accounting Marketing
- 22. Two resource problems Two Resource Problems Johnson’s Rule You Kim Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan SEQUENCE English Management Finance Accounting Marketing
- 23. Two resource problems Two Resource Problems Johnson’s Rule You Kim Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan SEQUENCE English Management Finance Accounting Marketing
- 24. Two resource problems Two Resource Problems Johnson’s Rule You Kim Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Sequences tasks to minimize makespan SEQUENCE English Management Finance Accounting Marketing
- 25. Two resource problems Two Resource Problems Johnson’s Rule You Kim Sequences tasks to minimize makespan Period 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Processing time (you): 2 6 3 5 1 4 3 5 4 2 Processing time (Kim): Idle time SEQUENCE English Management Finance Accounting Marketing
- 26. INDUSTRIAL APPLICATIONS Automobile Industry DNA Sequencing
- 27. Genome Sequencing Tyre Manufacturing Industry
- 28. Thank You