a-1 | |||||
1 | |||||
The processing sequence is the sequence for which jobs should be processed first | |||||
If the sequence is first come, first served. In this case we would go as per the sequence given | |||||
Therefore, sequence for first come, first served would be a-b-c-d-e-f | |||||
2 | |||||
If the processing sequence is job which takes shortest processing time. In this case the jobs which take lower time are processes first | |||||
Therefore, sequence would be b-e-a-c-d-f | |||||
3 | |||||
If the processing sequence is job which has earliest due date, in this case the jobs which has lowest due date is processed first | |||||
Therefore, sequence would be e-b-a-c-f-d | |||||
4 | |||||
Calculation of CR ratio so as to determine the processing sequence | |||||
Calculating iitial critical ratios at hour 0 | |||||
Job | Processing time (hours) | Due date (hours) | Critical ratio calculation | CR | |
a | 3.5 | 7 | (7-0)/3.5 | 2.00 | |
b | 2 | 6 | (6-0)/2 | 3.00 | |
c | 4.5 | 18 | (18-0)/4.5 | 4.00 | |
d | 5 | 22 | (22-0)/5 | 4.40 | |
e | 2.5 | 4 | (4-0)/2.5 | 1.60 | lowest |
f | 6 | 20 | (20-0)/6 | 3.33 | |
Job e is scheduled first | |||||
At hour 0 + 2.5 = 2.50 Job e completed, the critical ratio calculation is | |||||
Job | Processing time (hours) | Due date (hours) | Critical ratio calculation | CR | |
a | 3.5 | 7 | (7-2.5)/3.5 | 1.29 | lowest |
b | 2 | 6 | (6-2.5)/2 | 1.75 | |
c | 4.5 | 18 | (18-2.5)/4.5 | 3.44 | |
d | 5 | 22 | (22-2.5)/5 | 3.90 | |
f | 6 | 20 | (20-2.5)/6 | 2.92 | |
Job a is scheduled second | |||||
At hour 2.50 + 3.50 = 6 Job a completed, the critical ratio calculation is | |||||
Job | Processing time (hours) | Due date (hours) | Critical ratio calculation | CR | |
b | 2 | 6 | (6-6)/2 | 0.00 | lowest |
c | 4.5 | 18 | (18-6)/4.5 | 2.67 | |
d | 5 | 22 | (22-6)/5 | 3.20 | |
f | 6 | 20 | (20-6)/6 | 2.33 | |
Job b is scheduled third | |||||
At hour 6+2 = 8 job b is completed, the critical ratio calculation is | |||||
Job | Processing time (hours) | Due date (hours) | Critical ratio calculation | CR | |
c | 4.5 | 18 | (18-8)/4.5 | 2.22 | |
d | 5 | 22 | (22-8)/5 | 2.80 | |
f | 6 | 20 | (20-8)/6 | 2.00 | lowest |
Job f is scheduled fourth | |||||
At hour 8+6 = 14, job f is completed, the critical ratio calculation is | |||||
Job | Processing time (hours) | Due date (hours) | Critical ratio calculation | CR | |
c | 4.5 | 18 | (18-14)/4.5 | 0.88888889 | lowest |
d | 5 | 22 | (22-14)/5 | 1.6 | |
Job c is scheduled fifth | |||||
Therefore, job d is scheduled sixth | |||||
The processing sequence would be e-a-b-f-c-d | |||||
a-2 | |||||
First come first served | |||||
We will have to calculate flow time and tardy hours | |||||
Job flow time is the cumulative job time of processing sequence | |||||
Tardy time = Flow time - due date | |||||
Job | Job time (hours) | Due date (hours) | Flow time | Tardy days | |
a | 3.5 | 7.0 | 3.5 | 0.0 | |
b | 2.0 | 6.0 | 5.5 | 0.0 | |
c | 4.5 | 18.0 | 10.0 | 0.0 | |
d | 5.0 | 22.0 | 15.0 | 0.0 | |
e | 2.5 | 4.0 | 17.5 | 13.5 | |
f | 6.0 | 20.0 | 23.5 | 3.5 | |
23.5 | 75.0 | 17 | |||
Average job flow time = Total job flow time/Number of jobs | 23.50/6 | 12.50 | |||
Average job tardiness = Total job tardiness/Number of jobs | 17/6 | 2.83 | |||
Shortest processing time | |||||
sequence is b-e-a-c-d-f | |||||
Job | Job time (hours) | Due date (hours) | Flow time | Tardy days | |
b | 2 | 6 | 2 | 0 | |
e | 2.5 | 4 | 4.5 | 0.5 | |
a | 3.5 | 7 | 8 | 1 | |
c | 4.5 | 18 | 12.5 | 0 | |
d | 5 | 22 | 17.5 | 0 | |
f | 6 | 20 | 23.5 | 3.5 | |
23.5 | 68 | 5 | |||
Average job flow time = 77/6 | 11.33 | ||||
Average job tradiness = 5/6 | 0.83 | ||||
Earliest due date | |||||
Therefore, sequence would be e-b-a-c-f-d | |||||
Job | Job time (hours) | Due date (hours) | Flow time | Tardy days | |
e | 2.5 | 4 | 2.5 | 0 | |
b | 2 | 6 | 4.5 | 0 | |
a | 3.5 | 7 | 8 | 1 | |
c | 4.5 | 18 | 12.5 | 0 | |
f | 6 | 20 | 18.5 | 0 | |
d | 5 | 22 | 23.5 | 1.5 | |
23.5 | 69.5 | 2.5 | |||
Average job flow time = 69.5/6 | 11.58 | ||||
Average job tradiness = 5/6 | 0.42 | ||||
Critical ratio | |||||
The processing sequence would be e-a-b-f-c-d | |||||
Job | Job time (hours) | Due date (hours) | Flow time | Tardy days | |
e | 2.5 | 4 | 2.5 | 0 | |
a | 3.5 | 7 | 6 | 0 | |
b | 2 | 6 | 8 | 2 | |
f | 6 | 20 | 14 | 0 | |
c | 4.5 | 18 | 18.5 | 0.5 | |
d | 5 | 22 | 23.5 | 1.5 | |
23.5 | 72.5 | 4 | |||
Average job flow time = 72.5/6 | 12.08 | ||||
Average job tradiness = 3.5/6 | 0.67 | ||||
First come first served | Shortest processing time | Earliest due date | Critical ratio | ||
Average flow time | 12.50 | 11.33 | 11.58 | 12.08 | |
Average job tradiness | 2.83 | 0.83 | 0.42 | 0.67 |
Problem 16-17 Given the following information on job times and due dates Job Time Due Date (Hours...
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...
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...
Processing times and due dates of 9 ¡obs are given as follows: Job Proc Time Due Date 9 10 38 15 43 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...
Problem 18 Question Help Estimated Machine Time (hours) Time Since Order Due Date Arrived (hours ago) (hours from now) Order 1 0 2* 10 12 3 5 8 3 18 20 The due dates reflect the need for the order to be hours t its next operation. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average past due Using the FCFS (first come, first served) decision rule...
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 Processing time (weeks) 3.00 0.40 1.10 4.00 1.50 Due date (weeks) 3 556 3 12. What would be the lateness of job B? 13. What would be the tardiness of job E? 14. What is the average flow time for this set of jobs? 15. What is the maximum tardiness for this set of jobs? (0.10...
What would be the sequence of the following jobs if you did them in Earliest Due Date sequence? Job A B Processing Time Days Due from Today 18 24 16 16 26 10 14 12 21 30 С D E OE,A,D,B,C E,D,A,C,B OC,D,B,A,E, C.B.D.A,E Question 6 (10 points) You have 5 jobs to do. What would be the sequence if you chose to do a Shortest Processing Time Approach? Job Processing Time Days Due from Today А 24 30 B...
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...
a) Using the EDD (earliest due date) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received): At Morgan's Transformer Rebuilding, following jobs (below) are ready for dispatching to a work center. The processing times, date job received, and due dates for the jobs are given below. In what sequence would the jobs be ranked according to the decision rules on the left Sequence Job 1 Date Job...
a) Using the EDD (earliest due date) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received): At Morgan's Transformer Rebuilding, following jobs (below) are ready for dispatching to a work center. The processing times, date job received, and due dates for the jobs are given below. In what sequence would the jobs be ranked according to the decision rules on the left Sequence Job 1 Date Job...
Five jobs are waiting to be processed. Their processing times and due dates are given below. Using the shortest processing time dispatching rule, in which order should the jobs be processed? Processing Time (days) Job due date (days) Job A B 4 C 11 D 8 5 8 O A. D, A, E, B, C О в. D. В. Е. А. С О С. С. А, Е, в.р O D. C, E, A, B, D O E. B, D, A,...