4.3 Priority Sequencing Rules

Slides:



Advertisements
Similar presentations
1 A B C
Advertisements

Part 3 Probabilistic Decision Models
Operations Scheduling
Arithmetic and Geometric Means
Create an Application Title 1Y - Youth Chapter 5.
CALENDAR.
The 5S numbers game..
SCHEDULING Chapter 6 Summarized from course EK ABWL Produktion & Logistik and KFK Production Analysis 1.
Break Time Remaining 10:00.
The basics for simulations
PP Test Review Sections 6-1 to 6-6
Developing the Project Plan
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
GROUP MEMBERS: HAMIZAH BINTI HAMZAHB NORAINA BINTI MOHD YUSOFB NUR ADILA BINTI RAMLIB SHCEDULLING (PART II)
MaK_Full ahead loaded 1 Alarm Page Directory (F11)
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt Synthetic.
© 2007 Pearson Education Waiting Lines Supplement C.
Essential Cell Biology
Clock will move after 1 minute
PSSA Preparation.
Select a time to count down from the clock above
Production and Operations Management Systems
Operations Management For Competitive Advantage 1 Operations Scheduling Operations Management For Competitive Advantage Chapter 15.
Operations Scheduling
Scheduling.
© The McGraw-Hill Companies, Inc., Chapter 16 Operations Scheduling.
Operations Scheduling
PowerPoint presentation to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
14 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Operations Planning and Scheduling 14 For Operations Management, 9e by Krajewski/Ritzman/Malhotra.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J Operations.
1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 19 Operations Scheduling.
Scheduling. Production Planning Process Process Planning Strategic Capacity Planning Aggregate Planning Master Production Scheduling Material Requirements.
Scheduling Chapter 19.
Short-Term Scheduling
Operations Management
Inputs and Outputs to Aggregate Production Planning
Scheduling. Characteristics of a “job” Constituent operations Constituent operations Due date Due date Time of arrival in shop Time of arrival in shop.
Order Processing and Information Systems 1 Chapter 5 Order processing and information systems The cost of providing timely and accurate information has.
5. Operations Scheduling
1 By: Prof. Y. Peter Chiu Scheduling ~ HOMEWORK SOLUTION ~
1 ISQA 459/559 Mellie Pullman Scheduling Shop Floor.
1 Chapter 15 Scheduling. 2 Scheduling: Establishing the timing of the use of equipment, facilities and human activities in an organization Answering “when”
Scheduling – Day 2. Production Planning Process Process Planning Strategic Capacity Planning Aggregate Planning Master Production Scheduling Material.
1. Facility size 2. Equipment procurement Long-term
Scheduling.
15-1Scheduling William J. Stevenson Operations Management 8 th edition.
1 1 Slide Short – Term Scheduling Professor Ahmadi.
Scheduling Process and Production Management.
Operations Management Operations Scheduling
Scheduling for Low-volume Operations Chapter 15 Operations Management by R. Dan Reid & Nada R. Sanders 2nd Edition © Wiley 2005 PowerPoint Presentation.
Chapter 17 Scheduling. Management 3620Chapter 17 Schedule17-2 Overview of Production Planning Hierarchy Capacity Planning 1. Facility size 2. Equipment.
Scheduling. Scheduling: The allocation of resources over time to accomplish specific tasks. Demand scheduling: A type of scheduling whereby customers.
Scheduling for Low-volume Operations
Scheduling Seminar exercises Process and Production Management.
Scheduling. Scheduling of Operations A planning tool for the short term  Provides an opportunity to make use of new information as we approach real time.
CHAPTER 4 : SCHEDULING Presented by: HAMKA BIN TAIP
Scheduling Operations IDS 605 Spring Data Collection for Scheduling l Jobs l Activities l Employees l Equipment l Facilities Transparency 18.1.
Chapter 16 & 9 Scheduling Work & Employees. Scheduling Outline What needs to be scheduled? –doctor’s office, restaurant, mfg. plant, hospital –employees.
1 By: Prof. Y. Peter Chiu POM Chap-8: Scheduling ~ Homework Problems ~
0 Production and Operations Management Norman Gaither Greg Frazier Slides Prepared by John Loucks  1999 South-Western College Publishing.
Scheduling.
14 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Operations Planning and Scheduling 14 For Operations Management, 9e by Krajewski/Ritzman/Malhotra.
16 Scheduling (focus on sequencing; FCFS, SPT, EDD pages , and Johnson’s rule pages ) Homework; 6, 7, 11.
CHAPTER 8 Operations Scheduling
Short-Term Scheduling
8 Job Sequencing & Operations Scheduling CHAPTER Arranged by
Sequencing Sequencing: Determine the order in which jobs at a work center will be processed. Workstation: An area where one person works, usually with.
Scheduling Seminar exercises
Inputs and Outputs to Aggregate Production Planning
Presentation transcript:

4.3 Priority Sequencing Rules Priority Rules provide guidelines for the sequence in which jobs should be worked. In using this rules, job processing times and due dates are important pieces of information. Priority Rules try to minimize completion time, number of jobs in the system, and job lateness, while maximizing facility utilization.

4.3 Priority Sequencing Rules 4 types First come, first served (FCFS) Shortest processing time (SPT) Earlier due date (EDD) Critical Ratio (CR)

4.3 Priority Sequencing Rules First come, first served (FCFS) Jobs are processed in the order in which they arrive at a machine or work center. Shortest processing time (SPT) Jobs are processed according to processing time at a machine or work center, shortest job first. Earlier due date (EDD) Jobs are processed according t due date, earlier due date first. Critical Ratio (CR) Jobs are processed according to smallest ratio of time remaining until due date to processing time remaining.

4.3.1 Sequencing Rules: First Come, First Served (FCFS) Example 1 Five jobs are to be done at custom furniture shop: Do all the jobs get done on time? No, Jobs B, C, D and E are going to be late Job Days to Finish Date Promised A 2 5 B 8 C 6 12 D 4 10 E 1 SOLUTION: Measure of effectiveness: Sequence Work Time Flow Time Due Date Lateness A 2 5 B 8 10 C 6 16 12 4 D 20 E 1 21 17 TOTALS 69   33 Note! Flow time: is the amount of time a job spent in shop/factory Total work time/makespan: is the time needed to process given set of jobs Lateness: different between completion time and due date (if (–ve) put it zero)

4.3.1 Sequencing Rules: First Come, First Served (FCFS) Example 1 Performance measuring formula: #Average completion time = Total flow time ÷ No. of jobs #Average number of jobs = Total flow time ÷ Total job work time In the system #Average job lateness = Total late days ÷ No. of jobs #Utilization = Total job work time÷ Total flow time = in %

4.3.1 Sequencing Rules: First Come, First Served (FCFS) Example 2 Five jobs are to be assemble in AHP Plastic Sdn. Bhd.:

4.3.1 Sequencing Rules: First Come, First Served (FCFS) Example 2 SOLUTION:

4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Shortest Processing Time. Jobs with the shortest processing time are scheduled first. Jobs are sequenced in increasing order of their processing time. Shortest processing time is optimal for minimizing: Average and total flow time Average waiting time Average and total lateness

4.3.2 Sequencing Rules: Shortest Processing Time (SPT) The steps for using this rule are : Firstly, the user will input the number of jobs, the job names, the processing time and the due date of each job or use the data values given at the starting point. The second step is sorting out the shortest processing time among the jobs. Thirdly, calculate the flow time of each job by using the processing time. The flow time is the accumulation of processing time each job by each job.

4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 1 Suppose we have the four jobs to the right arrive for processing on one machine 11

4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 1 Answer: Shortest Operating Time Schedule Sequence Work Time Flow Time Due Date Lateness D 1 4 C 3 6 A 8 5 B 7 15 10 TOTAL 28   Jobs A and B are going to be late Average completion time 28/4 = 7 days Average number of jobs in the system 28/15 = 1.867 jobs Average lateness 8/4 = 2days Utilization 15/28 = 53.57%

4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 2 A Brake Pad have 5 process that will undergo before it will be produce at a particular point in time . The jobs are labeled A, B, C, D, and E in the order that they entered the shop. The respective processing times and due dates are given in the table below. Determine the schedule by using the SPT rule. Job sequence Processing Time Due Date A(turning) B(drilling) C(grinding) D(milling) E( facing) 6 2 8 3 9 18 15 23

4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 2 Solution:

4.3.2 Sequencing Rules: Shortest Processing Time (SPT) Example 2 #Average completion time = Total flow time ÷ No. of jobs #Average number of jobs = Total flow time ÷ Total job work time In the system #Average job lateness = Total late days ÷ No. of jobs #Utilization = Total job work time÷ Total flow time = in % Average completion time 65/5 = 13 days Average number of jobs in the system 65/28 = 2.3214 jobs Average lateness 9/5 = 1.8 days Utilization 28/65 = 43.08%

4.3.3 Sequencing Rules: Earliest Due Date (EDD) Jobs are sequenced in increasing order of their due dates; The job with earliest due date is first, the one with the next earliest due date is second, and so on; A priority sequencing rule that specifies that the job with the earliest due date is the next job to be processed

4.3.3 Sequencing Rules: Earliest Due Date (EDD) The steps for using this rule are : Firstly, the user will input the number of jobs, the job names, the processing time and the due date of each job or use the data values given at the starting point. The second step is sorting out the earliest due date among the jobs. Thirdly, calculate the flow time of each job by using the processing time. The flow time is the accumulation of processing time each job by each job.

4.3.3 Sequencing Rules: Earliest Due Date (EDD) The formulas for calculation are below: #Average completion time = Total flow time ÷ No. of jobs #Average number of jobs = Total flow time ÷ Total job work time In the system #Average job lateness = Total late days ÷ No. of jobs #Utilization = Total job work time÷ Total flow time = in %

Processing Time (Days) 4.3.3 Sequencing Rules: Earliest Due Date (EDD) Example 1 Five engine blocks are waiting for processing. The processing times have been estimated. Expected completion times have been agreed. The table shows the processing time and due date of those 5 engines. Determine the schedule by using the EDD rule. Engine Block Processing Time (Days) Due Date (Days) Ranger 8 10 Explorer 6 12 Bronco 15 20 Econoline 150 3 18 Thunderbird 22

4.3.3 Sequencing Rules: Earliest Due Date (EDD) Example 1 Engine (1) (2) (3) (2)-(3) Block Processing Completion Due Days Tardy Sequence Time Time Date (0 if negative) Ranger 8 10 Explorer 6 12 Econoline 150 3 18 Bronco 15 20 Thunderbird 12 22 8 0 32 12 14 2 17 0 44 22 Total 44 85 36 Average completion time 85/5 = 17 days Average number of jobs in the system 85/44 = 1.9318 jobs Average tardiness 36/5 = 7.2 days Utilization 44/85 = 51.76%

4.3.4 Sequencing Rules: Critical Ratio (CR) Is an index number computed by dividing the time remaining until due date by the work time remaining. The critical ratio gives priority to jobs that must be done to keep shipping on schedule. The critical ratio is measure of urgency of any order compared to the other orders for the same facility. The ratio is based on when the completed order is required and how much time is required to complete.

4.3.4 Sequencing Rules: Critical Ratio (CR) The step for using this rule are: At the starting program, user input the numbers of job, the jobs name, the works day remaining and the due date of each job and as well the today's date. The today's date and the number of job are just inputted once time. Then, the others are followed the value of the number of jobs inputted. After that, compute the critical ratio by using the formula. The formula for Critical Ratio is: CR = time remaining / works day remaining After calculating the CR for each job, give the priority order by using the value of the calculated critical ratio. The priority order is performed from smaller to larger.

4.3.4 Sequencing Rules: Critical Ratio (CR) There are 3 characteristics can be seen from the critical ratio: A job with low critical ratio(less than 1.0) ---- falling behind schedule. If  CR is exactly 1.0 ---- the job is on schedule. If CR is greater than 1.0 ---- the job is ahead of schedule and has some slack.

4.3.4 Sequencing Rules: Critical Ratio (CR) The critical ratio help in most production scheduling system as below: Determine the status of specific job. Establish relative priority among jobs on a common basis. Relate both stock and make-to-order jobs on a common basis. Adjust priorities (and revise schedules) automatically for changes in both demand and job progress. Dynamically track job progress and location.

4.3.4 Sequencing Rules: Critical Ratio (CR) Example 1 A machine center in a job shop for a local fabrication company has five unprocessed jobs remaining at a particular point in time. The jobs are labeled 1, 2, 3, 4, and 5 in the order that they entered the shop. The respective processing times and due dates are given in the table below. Sequence the 5 jobs by CR rules. Job number Processing Time Due Date 1 2 3 4 5 11 29 31 61 45 33 32

4.3.4 Sequencing Rules: Critical Ratio (CR) Example 1 Current time: t=0 Job number Processing Time Due Date Critical Ratio 1 2 3 4 5 11 29 31 61 45 33 32 61/11(5.545) 45/29(1.552) 31/31(1.000) 33/1 (33.00) 32/2 (16.00) Current time should be reset after scheduling one job Current time: t=31 Job number Processing Time Due Date-Current Time Critical Ratio 1 2 4 5 11 29 30 14 30/11(2.727) 14/29(0.483) 2/1 (2.000) 1/2 (0.500)

Critical Ratio (CR) Example 1 4.3.4 Sequencing Rules: Critical Ratio (CR) Example 1 Current time=60 Job number Processing Time Due Date-Current Time Critical Ratio 1 4 5 11 2 -27 -28 1/11(0.0909) -27/1<0 -28/2<0 Both Jobs 4 and 5 are later, however Job 4 has shorter processing time and thus is scheduled first; Finally, job 1 is scheduled last.

Critical Ratio (CR) Example 1 4.3.4 Sequencing Rules: Critical Ratio (CR) Example 1 Job number Processing Time Completion Time Due Date Tardiness 3 2 4 5 1 31 29 11 60 61 63 74 45 33 32 15 28 13 Totals 289 87 Average completion time 289/5 = 57.8 days Average number of jobs in the system 289/74 = 3.905 jobs Average tardiness 87/5 = 17.4 days Utilization 74/289 = 25.61%

4 Rules Application - Example Processing Time (including setup times) and due dates for six jobs waiting to be processed at a work center are given in the following table. Determine the sequence of jobs, the average flow time, average tardiness, and number of jobs at the work center, for each of these rules: FCFS SPT EDD CR Job number Processing Time Due Date A B C D E F 2 8 4 10 5 12 7 16 17 15 18

4 Rules Application – Example (FCFS) Job Sequence Processing Time Flow Time Due Date Tardiness A B C D E F 2 8 4 10 5 12 14 24 29 41 7 16 17 15 18 23 Totals 120 54 Average completion time 120/6 = 20 days Average number of jobs in the system 120/41 = 2.93 jobs Average tardiness 54/6 = 9 days Utilization 41/120 = 34.17%

4 Rules Application – Example (SPT) Job Sequence Processing Time Flow Time Due Date Tardiness A C E B D F 2 4 5 8 10 12 6 11 19 29 41 7 15 16 17 18 3 23 Totals 108 40 Average completion time 108/6 = 18 days Average number of jobs in the system 108/41 = 2.63 jobs Average tardiness 40/6 = 6.67 days Utilization 41/108 = 37.96%

4 Rules Application – Example (EDD) Job Sequence Processing Time Flow Time Due Date Tardiness C A E B D F 4 2 5 8 10 12 6 11 19 29 41 7 15 16 17 18 3 23 Totals 110 38 Average completion time 110/6 = 18.33 days Average number of jobs in the system 110/41 = 2.68 jobs Average tardiness 38/6 = 6.33 days Utilization 41/110 = 37.27%

4 Rules Application – Example (CR) At t=0, Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F 2 8 4 10 5 12 7 16 17 15 18 (7-0) / 2 = 3.5 (16-0) / 8 = 2.0 (4-0) / 4 = 1.0 (Lowest) (17-0) / 10 = 1.7 (15-0) / 5 = 3.0 (18-0) / 12 = 1.5 Job C is the first job to complete base on the lowest critical ratio.

4 Rules Application – Example (CR) At t=4, day 4 [C completed], Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F 2 8 - 10 5 12 7 16 17 15 18 (7-4) / 2 = 1.5 (16-4) / 8 = 1.5 (17-4) / 10 = 1.3 (15-4) / 5 = 2.2 (18-4) / 12 = 1.17 (Lowest) Job F is the second job to complete base on the lowest critical ratio.

4 Rules Application – Example (CR) At t=16, day 16 [C and F completed], Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F 2 8 - 10 5 7 16 17 15 (7-16) / 2 = -4.5 (Lowest) (16-16) / 8 = 0 (17-16) / 10 = 0.1 (15-16) / 5 = -0.2 Job A is the third job to complete base on the lowest critical ratio.

4 Rules Application – Example (CR) At t=18, day 18 [C, F and A completed], Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F - 8 10 5 16 17 15 (16-18) / 8 = -0.25 (17-18) / 10 = -0.10 (15-18) / 5 = -0.60 (Lowest) Job E is the fourth job to complete base on the lowest critical ratio.

4 Rules Application – Example (CR) At t=23, day 23 [C, F, A and E completed], Job Sequence Processing Time Due Date Critical Ratio Calculation A B C D E F - 8 10 16 17 (16-23) / 8 = -0.875 (Lowest) (17-23) / 10 = -0.60 Job B is the fifth job to complete base on the lowest critical ratio and follow by Job D in last.

4 Rules Application – Example (CR) Job Sequence Processing Time Flow Time Due Date Tardiness C F A E B D 4 12 2 5 8 10 16 18 23 31 41 7 15 17 11 24 Totals 133 58 Average completion time 133/6 = 22.17 days Average number of jobs in the system 133/41 = 3.24 jobs Average tardiness 58/6 = 9.67 days Utilization 41/133 = 30.83%

4 Rules Application – Example (CR) Average Flow Time (days) Average Tardiness (days) Average Number of Jobs at the Work Center Utilization (%) FCFS SPT EDD CR 20.00 18.00 18.33 22.17 9.00 6.67 6.33 9.67 2.93 2.63 2.68 3.24 34.17 37.96 37.27 30.83