Concept explainers
a)
To determine: Sequence of jobs based on decision rule First Come First Served (FCFS).
Introduction: First Come First Served is the
b)
To determine: Sequence of jobs based on decision rule Earliest Due Date (EDD).
Introduction: Earliest Due Date is the scheduling rule, which helps to arrange the sequence in the order. Here, the job with the earliest due date would be served first. Then, the process would be going on from the earliest due date to the latest due date.
c)
To determine: Sequence of jobs based on decision rule Shortest Processing Time (SPT).
Introduction: Shortest Processing Tine is the scheduling rule which helps to arrange the sequence in the order. Here, the job with the shortest duration would be served first. Then, the process would be going on from shortest to largest duration.
d)
To determine: Sequence of jobs based on decision rule Longest Processing Time (LPT).
Introduction: Largest Processing Tine is the scheduling rule, which helps to arrange the sequence in the order. Here, the job with the largest duration would be served first. Then, the process would be going on from largest to shortest duration.
Want to see the full answer?
Check out a sample textbook solutionChapter 15 Solutions
Principles of Operations Management: Sustainability and Supply Chain Management (10th Edition)
- Question fourThree jobs are to be scheduled on two machines A and B. Assume that the jobs are processed in the sequence A-B (A has to finish the job before B can continue the job). The processing times are: Job A B1 5 42 7 73 3 5Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.arrow_forwardFinite capacity scheduling Question 20 options: schedules jobs through a number of work centers, each with one or more machines. All of these choices are correct. is an extension of the theory of constraints. requires that jobs are scheduled whole (cannot be split).arrow_forwardQuestion 4: Six jobs waiting at a workstation will be processed in order, starting with the one with the shortest break time. In the table below, the time elapsed since the arrival of the works, the time remaining to the delivery and the processing time are given. According to this, create the work order and fill in the data in the relevant table.(fill in the second table in the photos)a) What is the average delay time with the generated order?b) How many hours is the average flow time?c) How many jobs will be delayed?d) How many jobs will not be delayed?arrow_forward
- QUESTION 5 (SCHEDULING: CYCLICAL SCHEDULING) 15.26 Daniel's Barber Shop at Newark Airport is open 7 days a week but has fluctuating demand. Daniel Ball is inter- ested in treating his barbers as well as he can with steady work and preferably 5 days of work with two consecutive days off. His analysis of his staffing needs resulted in the following plan. Schedule Daniel's staff with the minimum number of barbers. DAY MON. TUE. WED. THU. FRI. SAT. SUN. 6 5 5 5 6 4 3 Barbers neededarrow_forwardQuestion 32 The processing times of four jobs are given as follows: Job Processing time (minutes) A 10 B 30 C 16 D 24 Assume the jobs arrived in alphabetical order of the job name and no other job arrives in the next 70 minutes. What is the average flow time in minutes if the jobs are processed in shortest processing time (SOP) order? Group of answer choices 166 41.5 38 20.5arrow_forwardQuestion 7 Station 1 Machine A 20 min/unit Station 1 Machine B 20 min/unit Station 2 12 min/unit Station 3 8 min/unit A three station work cell is illustrated in the image above. A unit needs to be processed at either Machine A or Machine B for Station 1 (parallel lines, both lines doing the exact same thing). The unit is then processed at Stations 2 and 3 before leaving the work cell. What is the process time of this system measured in minutes/unit?arrow_forward
- Question one: Suppose a radiology department uses FCFS to determine how to sequence patient x-rays. Assuming these data are representative, compare between FCFS and other scheduling rules should the radiology department be using and why Processing Time (Minutes) Due Time (Minutes from Now) Patient A 35 140 B 15 180 35 360 D 25 290 E 30 420 F 25 20 G 35 180 H 30 290 20 110 K 25 150 L 15 270 M 30 390 20 220 20 400 P 10 330 Q 10 80 R 15 230 20 370arrow_forwardQUESTION 6 The framing department has six jobs waiting to be processed as shown in Table 3 below. It is now time zero and all jobs are ready to begin. Each has only one operation remaining. Table 3 Jobs (In order of arrival) Processing Time Due Date A 5 12 B 7 18 C 8. 14 D 3 10 E 9 22 F 12 17 Using minimum flow time as the evaluation criterion, recommend the best rule to sequence the jobs from the list below: i. FCFS ii. SOT iii. EDD iv. STRarrow_forward2arrow_forward
- Question Three Processing times (including setup times), and due dates for five jobs waiting to be processed at a work center are given in the following table. By Using the SPT rule determine the following: The sequence of jobs The average flow time The average job tardiness The average number of jobs at the work center Job Processing Time (hours) Hour Due A 17 15 B 10 25 C 5 20 D 7 32 E 11 38arrow_forwardQuestion attachedarrow_forwardQuestion one: Suppose a radiology department uses FCFS to determine how to sequence patient x-rays. Assuming these data are representative, compare between FCFS and other scheduling rules should the radiology department be using and why Processing Time (Minutes) Due Time (Minutes from Now) Patient A 35 140 B 180 15 35 360 25 290 E 30 420 25 20 G 35 80 30 290 20 110 K 25 15 150 270 M 30 390 20 220 20 400 10 330 10 80 R 15 230 20 370 当 五犯 LEzlolalolclnarrow_forward
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
- Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.