Concept explainers
a)
To determine: Thesequence of jobs based on the decision rule, i.e, First Come First Served (FCFS).
Introduction: The First Come First Served is the
b)
To determine: The sequence of jobs based on the decision rule, i.e, Earliest Due Date (EDD).
Introduction: The 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 go on from the earliest due date to the latest due date.
c)
To determine: The sequence of jobs based on the decision rule, i.e, Shortest Processing Time (SPT).
Introduction: The Shortest Processing Time is the scheduling rule, which helps to arrange the sequence in the order. Here, the job with the shortest duration is served first. Then, the process would be go on from the shortest to the largest duration.
d)
To determine: The sequence of jobs based on the decision rule, i.e, Longest Processing Time (LPT).
Introduction: The Largest Processing Tine is the scheduling rule, which helps to arrange the sequence in the order. Here, the job with the largest duration is served first. Then, the process would go on from the largest to the shortest duration.
Want to see the full answer?
Check out a sample textbook solutionChapter 15 Solutions
Operations Management
- 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_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_forwardQuestion 1 Four floral arranging jobs are to be carried out across three stations: A (Arrange), B (Bag), C (crop) shown. The station sequences and job times in minutes are shown below, along with the due dates for each job. Using an "earliest due date" job dispatching priority rule, which, if any, of the jobs in will be late? Tip: create a Gantt chart schedule before answering Questions 4 & 5. a. Jobs 2 & 3 b. Jobs 3 & 4 c. Job 3 d. Job 4 e. None of the jobs will be latearrow_forward
- Allocate the tasks to workstations taking into consideration the precedence requirements and using the LOT rule to break ties between feasible tasks.arrow_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_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_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 9arrow_forwardWhat is the answerarrow_forward
- Question 34 Consider the processing times and priorities for four jobs: Job Processing time (minutes) Weight/Priority (cost per minute) A 10 6 B 2 1 C 50 2 D 16 10 Assume the weighted shortest processing time (WSPT) rule is used. Which job should be processed third? Group of answer choices A B C Darrow_forwardQ4 An arsenal has six tasks waiting to be processed and the processing time and due completion time for each task is shown in the table below. Assuming that the tasks given are in the order of the table: Mission A B CA D< E F Processing time (days)< 6 12< 14 24 10< 4 Due for completion (days)< 22< 14 30 184 25 34< Requirements 1. Sort the jobs according to the first come first served rule and the shortest processing time rule and calculate the average completion time, average number of jobs in the system, average delay time and equipment utilization respectively and explain which is the better sorting method.arrow_forwardQuestion3: Two processes are applied in the same order to the jobs coming to a workstation. The durations of both processes for the six jobs coming to the workstation are as seen in the table. In order to minimize the total time to be spent on the jobs, the order in which the jobs should be done will be determined by the "johnson" rule. Accordingly, in the table below, write the order in which the business should do the work, in order, with the first things to be done on the far left, and one action to be written in each blank.1-) When the jobs are done in this order, how many minutes will it take to complete all the jobs?2-)1. How many minutes of space will there be in total in the process and the 2nd process?arrow_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.