Q.1 Process times for all jobs are one hour. Changeovers between families requir
ID: 424881 • Letter: Q
Question
Q.1 Process times for all jobs are one hour. Changeovers between families require four hours. Thus, the completion time for job 1 is 5, for job 2 is 6, for job 3 is 11, and so on.
Job Number
Family Code
Due Date
1
1
5
2
1
6
3
2
12
4
2
13
5
1
15
6
1
19
7
1
20
8
2
22
9
2
25
10
1
27
a) How many possible sequences are there?
b) Compute the total tardiness of the current sequence (i.e. 1 to 10).
c) Is there any sequence with no tardiness?
d) Here, the processing times are deterministic (one hour). Suppose you are dealing with
uniformly distributed stochastic processing times (e.g. 45 < t< 75 minutes). Provide
some suggestions about handling varying operating times in scheduling activities
Job Number
Family Code
Due Date
1
1
5
2
1
6
3
2
12
4
2
13
5
1
15
6
1
19
7
1
20
8
2
22
9
2
25
10
1
27
Explanation / Answer
Answer:
Job
Family
Due Date
Comp Time
Tardiness
0
0
0
0
0
1
1
5
5
0
2
1
6
6
0
3
2
12
11
0
4
2
13
12
0
5
1
13
17
4
6
1
19
18
0
7
1
20
19
0
8
2
20
24
4
9
2
26
25
0
10
1
28
30
2
Total Tardiness
10
c) A sequence with no tardiness can be found with trial and error
Job
0
Job
Family
Due Date
Comp Time
Tardiness
0
0
0
0
0
1
1
5
5
0
2
1
6
6
0
3
2
12
11
0
4
2
13
12
0
5
1
13
17
4
6
1
19
18
0
7
1
20
19
0
8
2
20
24
4
9
2
26
25
0
10
1
28
30
2
Total Tardiness
10
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.