Concept explainers
A
Interpretation: The sequence of the jobs is to be determined in order to minimize mean flow time.
Concept Introduction: The activities under a project are programmed based on the needs of the individual and attaining ease is the priority of the individual. The mean flow time is the average time that a task takes to be processed within a computer system.
B
Interpretation:The sequence of the jobs is to be determined in order to minimize the number of tardy jobs.
Concept Introduction: The activities under a project are programmed based on the needs of the individual and attaining ease is the priority of the individual.Tardiness is the delay in executing a certain job to be executed within a computer system.
C
Interpretation: The sequence of the jobs is to be determined in order to minimize maximum lateness.
Concept Introduction: The activities under a project are programmed based on the needs of the individual and attaining ease is the priority of the individual.The EDD rule will be aiding for minimizing the maximum lateness of the project.
D
Interpretation:The sequence of the jobs in order to determine the make span for any sequence.
Concept Introduction: In the manufacturing process, the difference between beginning and the ending of a sequence of jobs or tasks is referred to as the make span.
Trending nowThis is a popular solution!
Chapter 9 Solutions
Production and Operations Analysis, Seventh Edition
- The job that should be scheduled last when usingJohnson’s rule is the job with the:a) largest total processing time on both machines.b) smallest total processing time on both machines.c) longest activity time if it lies with the first machine.d) longest activity time if it lies with the second machine.e) shortest activity time if it lies with the second machine.arrow_forwardThree jobs are to be scheduled on two machines A & B . Assume that the jobs are processed in the Sequence A-B. The processing times are : The Question is : Draw a Gantt Chart that shows the Schedule Corresponding to the sequences 1-2-3 of the jobs Job A B 1 5 4 2 7 7 3 3 5arrow_forwardSix jobs are to be processed through a two-stepoperation. The first operation involves sanding, and the second involves painting. Processing times are as follows: Determine a sequence that will minimize the total completiontime for these jobs. Illustrate graphically.arrow_forward
- 24 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_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_forwardFive jobs must be scheduled for batch processing on a mainframe computer system. The processing times and the promised times for each of the jobs are listedhere.Job 1 2 3 4 5Processing time 40 min 2.5 hr 20 min 4 hr 1.5 hrPromised time 11:00 A.M. 2:00 P.M. 2:00 P.M. 1:00 P.M. 4:00 P.M.Assume that the current time is 10:00 A.M.a. If the jobs are scheduled according to SPT, find the tardiness of each job and themean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD schedulingarrow_forward
- Eight jobs are to be processed through a single machine. The processing times and due dates are given here. (given) Furthermore, assume that the following precedence relationships must besatisfied:           2→ 6 → 3.           1 → 4 → 7 → 8.Determine the sequence in which these jobs should be done in order tominimize the maximum lateness subject to the precedence restrictions.arrow_forwardSuppose that 12 jobs must be processed through six machines. If the jobs may beprocessed in any order, how many different possible schedules are there? If youwere to run a computer program that could evaluate 100 schedules every second,how much time would the program require to evaluate all feasible schedules?arrow_forwardSix jobs are to be processed through a two-step operation. The first operation involves sanding, and the second involves painting. Processing times are as follows:                                             Determine a sequence that will minimize the total completiontime for these jobs. Illustrate graphically.arrow_forward
- The following five overhaul jobs a re waiting to be processed at Avianic's Engine Repair Inc. These jobs were logged as they arrived. All dates are specified as planning calendar days.Assume that all jobs arrived on day 180; today's date is 200                                                                    Using the critical ratio scheduling rule, in what sequence would the jobs be processed?arrow_forwardDevelop a Gantt chart to schedule the 6 jobs. Suppose you want to schedule the jobs in order 1 through 6.arrow_forwardAn organization faces heavy penalties for jobs that are not completed on time. Which of the following priority rules should the operations manager use when sequencing​ jobs?  A.​EDD: earliest due date  B.​SPT: shortest processing time  C.​LPT: longest processing time  D.​FCFS: first​ come, first servedarrow_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.