Concept explainers
A
Interpretation: The sequence of the trucks that should be unloaded so as to minimize the mean flow time is to be determined.
Concept Introduction: Under the mean flow time, the schedule to be defined will be the sum of time required for executing all tasks in the system.
B
Interpretation: The sequence of the trucks that should be unloaded so as to minimize the maximum lateness is to be determined.
Concept Introduction: The job sequencing process is the process in which the jobs are arranged in a particular order.
C
Interpretation: Based on the given information in the above problem, find out the sequence of the trucks that should be unloaded so as to minimize the number of tardy jobs.
Concept Introduction: The tardy jobs are those that result in delay in executing the related operations..
Want to see the full answer?
Check out a sample textbook solutionChapter 9 Solutions
EBK PRODUCTION AND OPERATIONS ANALYSIS
- Please solve it as soon as possiblearrow_forwardGiven the following information on job times and due dates. Job Job Time(Hours) Due Date(Hours) a 3.5 7 b 2.0 6 c 4.5 18 d 5.0 22 e 2.5 4 f 6.0 20 a-1. Determine the optimal processing sequence using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. Sequence for First come, first served Sequence for Shortest processing time Sequence for Earliest due date Sequence for Critical ratio a-2. For each method, find the average job flow time and the average job tardiness. (Round your answers to 2 decimal places.) First Come, FirstServed Shortest ProcessingTime Earliest Due Date Critical Ratio Average flow time Average job tardinessarrow_forward24 The job that arrived first at a work center or machine will be processed first and completed. Which of the following priority rules does this statement represent? a first come, first served b shortest processing time c critical ratio d earliest due datearrow_forward
- Five welding jobs are waiting to be processed. Their processing times and due dates are given below. Using the critical ratio dispatching rule, in which order should the jobs be processed? All dates are specified as days from today. A B, D, A, E, C B C, E, A, D, B C E, B, A, D, C D C, D, A, B, E Job A B Processing Time (days) 4 2 Job due date (days) 7 4 C 8 11 D 3 5 E 5 11arrow_forwardSeven jobs are to be processed through a single machine. The processing times anddue dates are given here.Job 1 2 3 4 5 6 7Processing time 3 6 8 4 2 1 7Due date 4 8 12 15 11 25 21Determine the sequence of the jobs in order to minimizea. Mean flow time.b. Number of tardy jobs.c. Maximum lateness.d. What is the makespan for any sequence?arrow_forwardThe following six jobs are waiting in queue to be scheduled on a machine center. A. Sequence the jobs to minimize the number of tardy jobs for a single machine. B. Provide the optimal sequence including the six jobs.arrow_forward
- Job Processing time (Days) Job Due Date (Days) A 12 18 14 23 C 7 15 2 7 There are painting jobs awaiting at a paint shop. Their processing times and due dates are shown in the table. The firm wants to determine the sequence of jobs according to shortest processing time (SPT). Jobs are assigned a letter in the order day arrived. The utilization is _%. Today is day 1 and work begins today.arrow_forward2. The operations manager of an assembly and paint shop has five trucks to schedule for repair. He would like to minimize the throughput time (makespan) to complete all work on these cars. Each truck requires assembly prior to painting. The estimates of the times required to do the assembly and paint work on each are as follows:Use Johnson's rule to sequence these five jobs for minimum total duration. Show your step by step work in determining the job sequence and calculate the total duration of finishing assembly and painting operations on all the five trucks ?arrow_forwardThe company has received 7 special jobs. These jobs have to go through Process X, Process Y and then Process Z in sequence. Each of the processes is operated by a dedicated machine. What is the optimal sequence to schedule the jobs? Show your steps. If there is more than one optimal sequence under the adapted Johnson’s rule, show them all.arrow_forward
- Five jobs are planned to be scheduled. Each of the jobs must be processed on three machines (A, B, and C) in the same order. The processing times are listed below. Use Johnson's Rule to determine the optimal sequence of jobs. Job B 16 10 11 10 14 20 12 3 10 8 4 1 O a) 3-1-2-4-5 O b) Johnson's Rule is not an Optimal Technique O c) 1-2-3-4-5 O d) 5-4-3-1-2 O e) 5-4-3-2-1 O) 5-4-2-1-3 O e) 5-4-2-3-1 2345arrow_forwardThere are five jobs (namely 1,2,3,4 and 5), each of which must go through machines A, B and C in the order ABC. Processing Time (in hours) are given below: Jobs 1 2 3 4 Machine A 5 9. Machine B 2 1 4 Machine C 3 7 7 Find the sequence that minimizes the total elapsed time required to complete .the jobs The idle time for each :machine is shown belowarrow_forwardCourtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning, and she must decide in what order to write the code. Assume that all jobs arrived today (day 1 and hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day. JOB DUE DATE (HOURS HENCE) 18 36 10 22 14 E a) Sequence the jobs according to EDD. According to the EDD rule, the sequence of jobs should be b) What is the average completion (flow) time? The average completion (flow) time is c) What is the average job lateness? The average job lateness is d) What is the average number of jobs in the system? The average number of jobs in the system is place). DURATION (HOURS REQUIRED) 3 19 4 9 5 days (round your response to one decimal place) days (round your response to one decimal place). jobs (round your response to one decimalarrow_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.