Question

1. The table shows the jobs to be scheduled and estimated process times for the jobs....

1. The table shows the jobs to be scheduled and estimated process times for the jobs. The promised delivery times are shown in the table.

Job process time delivery due time slack time
A 4 75
B 16 90
C 2 30
D 27 90
E 5 90
F 38 75
G 26 120

Determine the average process completion time and average delay using (i) the shortest processing time first and (ii) the minimum slack time first dispatch rules.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Here, Important Formulas are

slack time Remaining = Delivery Due time - Process Time

Flow Time = cumulative process time,

Lateness = Flow time - Delivery Due time,

Average process completion time = Total Flow time/ Number of Jobs

Average Delay or lateness = Total Lateness/number of Jobs

For Shortest processing time, we will consider the activities in order of shortest processing time,

For Minimum Slack time, we we will consider the activities in order of Minimum slack time,

1 B C D E F
2 Job process time delivery due time slack time Remaining = Delivery Due time - Process Time
3 A 4 75 71
4 B 16 90 74
5 C 2 30 28
6 D 27 90 63
7 E 5 90 85
8 F 38 75 37
9 G 26 120 94
10
11 Shortest Processing Time
12 Job Process time Flow Time delivery due time Lateness
13 C 2 2 30 0
14 A 4 6 75 0
15 E 5 11 90 0
16 B 16 27 90 0
17 G 26 53 120 0
18 D 27 80 90 0
19 F 38 118 75 43
20 Average Process completion Time Average Lateness
21 42.43 6.14
22
23 Minimum Slack Time
24 Job Process time Flow Time delivery due time Lateness
25 C 2 2 30 0
26 F 38 40 75 0
27 D 27 67 90 0
28 A 4 71 75 0
29 B 16 87 90 0
30 E 5 92 90 2
31 G 26 118 120 0
32 Average Process completion Time Average Lateness
33 68.14 0.29

Formula

1 B C D E F
2 Job process time delivery due time slack time Remaining = Delivery Due time - Process Time
3 A 4 75 =D3-C3
4 B 16 90 =D4-C4
5 C 2 30 =D5-C5
6 D 27 90 =D6-C6
7 E 5 90 =D7-C7
8 F 38 75 =D8-C8
9 G 26 120 =D9-C9
10
11 Shortest Processing Time
12 Job Process time Flow Time delivery due time Lateness
13 C 2 =C13 30 0
14 A 4 =C14+D13 75 0
15 E 5 =C15+D14 90 0
16 B 16 =C16+D15 90 0
17 G 26 =C17+D16 120 0
18 D 27 =C18+D17 90 0
19 F 38 =C19+D18 75 =D19-E19
20 Average Process completion Time Average Lateness
21 =AVERAGE(D13:D19) =AVERAGE(F13:F19)
22
23 Minimum Slack Time
24 Job Process time Flow Time delivery due time Lateness
25 C 2 =C25 30 0
26 F 38 =C26+D25 75 0
27 D 27 =C27+D26 90 0
28 A 4 =C28+D27 75 0
29 B 16 =C29+D28 90 0
30 E 5 =C30+D29 90 =D30-E30
31 G 26 =C31+D30 120 0
32 Average Process completion Time Average Lateness
33 =AVERAGE(D25:D31) =AVERAGE(F25:F31)
Add a comment
Know the answer?
Add Answer to:
1. The table shows the jobs to be scheduled and estimated process times for the jobs....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • The following table contains information regarding jobs that are to be scheduled through one machine. Assume...

    The following table contains information regarding jobs that are to be scheduled through one machine. Assume jobs are listed in order of arrival (i.e., A, then B, then C, etc.). JOB PROCESSING TIME (DAYS) DUE DATE     A 7 20     B 15 21     C 1 16     D 12 17     E 11 15     F 4 6     G 5 12 Round your answers to 1 decimal place. a. What is the first-come, first-served (FCFS) schedule? b. What is the shortest operating time...

  • 4. [10 points] Today is Nov 15. The following jobs need to be scheduled on the...

    4. [10 points] Today is Nov 15. The following jobs need to be scheduled on the same machine. Job Processing Time (Davs) Due Date Nov 30 Dec 22 Nov 18 Dec 3 Nov 29 12 a. Schedule the jobs according to i. Shortest processing time ii. Earliest due date. iii. Longest processing time. b. For the SPT& EED schedules from part a, calculate the average completion time.

  • ABC Enterprises has five jobs that must be scheduled for production at a work center. Below...

    ABC Enterprises has five jobs that must be scheduled for production at a work center. Below are the processing times and due dates for each job.                                     Job Processing Time (in days) Due Date (days from today) 1 7 14 2 5 21 3 3 10 4 2 7 5 6 9                                                                                                                            Schedule the jobs by sequencing them using the Earliest Due Date (EDD) priority rule. What is the average flow time? Show your Work and round your...

  • Question No.2: Table below provides the processing times in hours of seven jobs to be processed...

    Question No.2: Table below provides the processing times in hours of seven jobs to be processed on four machines in the order Mi-M2-M3-M4. Obtain the sequence that minimises the total processing time, calculate the minimum time taken to process these seven jobs on four machines, and calculate the minimum value of idle time for each of the machines Data on processing times in hours Job Machine MI 12 M2 MO 9 M4

  • Jobs arrive at a single-CPU computer facility with interarrival times the are IID exponential ran...

    Jobs arrive at a single-CPU computer facility with interarrival times the are IID exponential random variables with mean 1 minute. Each job specifies upon arrival the maximum amount of processing time it requires, and the maximum times for successive jobs are IID exponential random variable with mean 1.1 minutes. However, if m is the specified maximum processing time for a particular job, the actual processing time is distributed uniformly between 0.55m and 1.05m. The CPU will never process a job...

  • The following table contains information concerning four jobs that are awaiting processing at a work center....

    The following table contains information concerning four jobs that are awaiting processing at a work center. Job Job Time (Days) Due Date (Days) A 14 20 B 10 16 C 7 15 D 6 17 a. Sequence the jobs using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. Assume the list is by order of arrival. Sequence for First come, first served   (Click to select)   A-B-C-D   D-C-B-A   C-B-D-A   A-C-D-B Sequence for Shortest processing time   (Click...

  • 1. Suppose you have four jobs that must be processed, with the following table giving their...

    1. Suppose you have four jobs that must be processed, with the following table giving their charac- teristics(all times in hours): Each job can be processed on any of three identical machines; to be Job 1 23 4 Processing time 21.524 | 2 | 0 | 0.5 | 1 Release time Processing time 5346 finished, a job must be processed for its entire processing time, but this processing time can be interrupted and even moved to a different machine if...

  • Problem #1 Five jobs are to be processed through a single machine. The processing times and...

    Problem #1 Five jobs are to be processed through a single machine. The processing times and due dates are given here. Assume all released dates are zero. Job 1 2 3 4 5 Processing time 3 6 5 4 2 Due date 4 8 12 21 15 In each of the following cases determine the sequence in which she should perform and compute Mean Flow Time, Average Tardiness and the number of tardy jobs. A) Shortest Processing Time B) Early...

  • please answer this ABC's machine shop is considering the use of priority scheduling rule in the...

    please answer this ABC's machine shop is considering the use of priority scheduling rule in the fabrication shop and must decide whether to use: a. Critical ratio (CR) Earliest due date (EDD) C. Shortest operation next (SON)/Shortest processing time 9SPT) d. Order Slack Order No. Total Remaining Time Remaining Current operation Manufacturing until Due Date Processing time Time (days) (days) (days) А 12 15 10 14 D 18 15 19 Using the four sequencing rules, compute the scheduling priority for...

  • Processing times and due dates of 9 jobs are given as follows: Job Proc Time Due Date 15 43 10 38...

    Processing times and due dates of 9 jobs are given as follows: Job Proc Time Due Date 15 43 10 38 35 40 25 20 40 Assume that all jobs arrive at time 0 a) (3 points) Generate a schedule that minimizes the mean flow time. Break ties with the smallest job number first (i.e., if 3 and 8 have identical parameters, 3 should be scheduled first). b) (3 points) Calculate mean flow time, mean tardiness, and maximum tardiness of...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT