| The sequence is
.
|
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 |
|
| Sequence for Shortest processing time |
|
| Sequence for Earliest due date |
|
| Sequence for Critical ratio |
|
|
| b. |
For each of the methods in part a, determine (1) the average job flow time, (2) the average tardiness, and (3) the average number of jobs at the work center. (Round your intermediate calculations and final answers to 2 decimal places.)
|
| |
First Come, First Served |
Shortest Processing Time |
Earliest Due Date |
Critical Ratio |
| Average job flow time |
|
| Sequence for Slack per operation |
|
|
| b. |
Compute the effectiveness of each rule using each of these measures: (1) average completion time, (2) average number of jobs at the work center. (Round your answers to 2 decimal places.) |
| |
First Come, First Served |
Slack per Operation |
| Average completion time |
. |
| b. |
Determine idle time of center 2, assuming no other activities are involved. |
| Idle time |
| A shoe repair operation uses a two-step sequence that all jobs in a certain category follow. For the group of jobs listed, |
| |
JOB TIMES (minutes)
|
| |
A |
B |
C |
D |
E |
| Workstation A |
27 |
18 |
70 |
26 |
15 |
| Workstation B |
45 |
33 |
30 |
24 |
10 |
|
| a. |
Find the sequence that will minimize total completion time. |
| b. |
Determine the amount of idle time for workstation B. |
| Average job tardiness |
new average job tardiness is [removed] minutes.
|
[removed] minutes
|
|
0 comments