KThe jobs listed below need to be completed. Assume that it is now day 140. If the jobs are sequenced according to the longest processing timerule, what is the average completion time (in days)? (Round answer to one decimal place)A. 38.8 daysB. 59.6 days.OC 16.4 daysAD 520 daysProcessing Job due dateTime (days)A20B26C2WID16E18Job(days)180200175230210 KThe jobs listed below need to be completed. Assume that it is now day 140. If the jobs are sequenced according to the longest processing timerule, what is the average completion time (in days)? (Round answer to one decimal place)A. 38.8 daysB. 59.6 days.OC 16.4 daysAD 520 daysProcessing Job due dateTime (days)A20B26C2WID16E18Job(days)180200175230210

Answered: The jobs listed below need to be…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

1. What is the cycle time? 2. What is the theoretical minimum number of workstations? 3. Which of the following statements is FALSE? a. All of the tasks A, B and C should be finished first before task F can be started. b.All of the tasks A through H should be finished first before task I can be started. c.Tasks A, B, and C can be started as soon as possible. d. All of the tasks B, E, C and F should be finished first before task H can be started.
A computer center has two identical computers for batch processing. Thecomputers are used as parallel processors. Job times are estimated by the user, but experience has shown that an exponential distribution gives an accurate description of the actual job times. Suppose that at a point in time there are eight jobs remaining to be processed with the following expected job times (expressed in minutes):Job 1 2 3 4 5 6 7 8Expected time 4 8 1 50 1 30 20 6a. In what sequence should the jobs be processed in order to minimize theexpected completion time of all eight jobs (i.e., the makespan)?b. Assume that computer A is occupied with a job that has exactly two minutes of processing time remaining and computer B is idle. If job times are deterministic, show the start and end times of each job on each computer using the sequence derived in part (a).
Seven 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?
Processing times and due dates for five jobs are shown in the table below. Assume the jobs are processed using the earliest-due-date rule. Job A B C D E Processing time (weeks) 2 0.7 1 4 1.3 Due time (weeks) 1 8 4 5 2 12. What would be the lateness of job B? What would be the tardiness of job E? 14. What is the maximum tardiness for this set of jobs? Note: Round your answer to 1 decimal place. 15. What is the average flow time for this set of jobs? Note: Round your answer to the nearest whole number.
College students always have a lot of work to do, but thissemester, Katie Lawrence is overwhelmed. Following arethe assignments she faces, the estimated completion times(in days), and due dates:Help Katie prioritize her work so that she completes asmany assignments on time as possible. Today is November2. How would your sequence of assignments change ifKatie were interested in minimizing the mean tardiness ofher assignments?
At the campus copy shop, six jobs have arrived in the order shown (A, B, C, D, E, and F) at the beginning of the day 1 (today, which is a work day). All of the jobs are due at various times today. Your job is to evaluate four common sequencing rules. JOB DUE (IN HOURS) DURATION (HOURS REQUIRED) A 8 (this job is due in 8 hours) 1.65 B 5.5 (this job is due in 5.5 hours) 1.20 C 4.5 (this job is due after lunch in 4.5 hours) 0.85 D 6 (this job is due in 6…
Given the following information on job times and due dates, determine the optimal processingsequence using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, find the average jobflow time and the average job tardiness. Jobs are listed in order of arrival.JobJob Time(hours)Due Date(hours)a 3.5 7b 2.0 6c 4.5 18d 5.0 22e 2.5 4f 6.0 20
Complete the table; find average lateness, average completion time, and average number of jobs in the system. Assume all durations are in days and that the jobs are processed at the shop in the order that they arrive (A then B then C then D). Today is day 1. Job Process Time Flow Time Due Date Lateness A 15 30 B 3 9 C 12 22 D 15 40 Sum (Average) 45 (11.25) Avg. lateness = ? days Avg. completion time = ?? days Avg. number of jobs in the system = ? jobs
Given 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 tardiness
Use the S/O rule to schedule the following jobs. Note that processing time includes the timeremaining for the current and subsequent operations. In addition, you will need to know thenumber of operations remaining, including the current one.JobRemainingProcessingTimeDueDateRemainingNumber ofOperationsA 4 14 3B 16 32 6C 8 8 5D 20 34 2E 10 30 4F 18 30 2
Five 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 scheduling
. Assume the jobs displayed in Table 18.22 need to be processed on a single resource andare sequenced with the WSPT rule. Which job would be processed second?a. Ab. Bc. Cd. De. E

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

Purchasing and Supply Chain Management

Operations Management

ISBN:

9781285869681

Author:

Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson

Publisher:

Cengage Learning

Production and Operations Analysis, Seventh Editi…

Operations Management

ISBN:

9781478623069

Author:

Steven Nahmias, Tava Lennon Olsen

Publisher:

Waveland Press, Inc.

SEE MORE TEXTBOOKS