The framing department has five jobs waiting to be processed. It is now time zero and all jobs are ready to begin. Each has onlyone operation remaining. All jobs arrived at the same time, and FCFS begins with job a, then b, etc.Processing Time (days)Due Date (days)JobsabCdeABOn day 9On day 13If the Earliest Due Date (EDD) rule is used, when will job a be finished?On day 174On day 196278879614

Answered: The framing department has five jobs…

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

The following 5 overhaul jobs are waiting to be pro-cessed 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.JOB DUE DATE REMAINING TIME (DAYS)103 214 10205 223 7309 217 11412 219 5517 217 15Using the critical ratio scheduling rule, in what sequence wouldthe jobs be processed?
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?
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?
Given the data below, using the SPT heuristic sequencing rule, determine the completion date and tardiness for each job as well as the average completion time and average tardiness for all four jobs. Which of the following statements is true? Job Processing time (days) Due date (in days) A 10 10 B 5 8 C 15 25 D 8 15 a.Jobs B and D will have no tardiness b.The tardiness for Job A is 12 days c.The average tardiness is 19.75 d.The average completion time is 6.5
If the jobs displayed in Table 18.23 are processed using the earliest-due-date rule, whatwould be the lateness of job B?
Three 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 B 1 5 4 2 7 7 3 3 5 Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.
Three 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 5
The constraints governing the jobs are as fo1lows: A and B are start jobs; A controls C, D and E; B controls F and J; G depends upon C; H depends on D; E and F control I and L; K follows J; L is also controlled by K; G, H, I and L are the last jobs. Draw the network,
Suppose 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?
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 listed here. (given) 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 the mean tardiness of all jobs.b. Repeat the calculation in part (a) for EDD scheduling.
Ron Satter field's excavation company uses bothGantt scheduling charts and Gantt load charts.a) Today, which is the end of day 7, Ron is reviewing the Ganttchart depicting these schedules:• Job # 151 was scheduled to begin on day 3 and to ta ke6 days. As of now, it is I day ahead of schedule.• Job# 177 was scheduled to begin on day J and take 4 days.It is currently on time.• Job #1 79 was scheduled to start on day 7 and take 2 days. Itactually got started on day 6 and is progressing according toplan.• Job #211 was scheduled to begin on day 5, but missingequipment delayed it until day 6. It is progressing asexpected and should take 3 days.• Job #215 was scheduled to begin on day 4 and take 5 days.It got sta rted on time but has since fallen behind 2 days.Draw the Gantt scheduling chart for the activities described.b) Ron now wants to use a Ga ntt load chart to see how muchwork is scheduled in each of his three work teams: Able,Baker, and Charlie. Five jobs constitute the current…

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