Compute the total tardiness of the sequence


Discuss the below:

Q: 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.

    Family Due

Job Code Date

1 1 5
2 1 6
3 2 12
4 2 13
5 1 13
6 1 19
7 1 20
8 2 20
9 2 26
10 1 28

a) Compute the total tardiness of the sequence.

b) How many possible sequences are there?

c) Find a sequence with no tardiness.

Request for Solution File

Ask an Expert for Answer!!
Operation Management: Compute the total tardiness of the sequence
Reference No:- TGS02051088

Expected delivery within 24 Hours