Given Problem

Twelve jobs are to be sequenced through a facility that can only

process one job at a time. The jobs and their respective processing
times (Pj), due dates (Dj), and weights (Wj) are shown on the table
shown below. Currently, time (t) is equal to 0.
Job
1
2
3
4
5
6
7
8
9
10
11
12

Pj
5
6
19
22
18
14
23
16
21
20
15
8

Dj
25
10
100
70
100
100
70
100
70
180
180
180

Wj
2
1
1
3
1
2
2
1
1
3
3
1

I. Sequence the jobs through the facility under the following

objectives:
Excel, particularly the Solver tool, was used in solving for the
optimal sequence for the required objectives. The optimal sequence
table will be shown for each as well as the parameters set for the
Solver tool and a Gantt chart produced from Lekin.
The highlighted cells correspond to the objective cells, while the
sequence cells are the ones that are being changed as well as the ones
added in the constraint wherein each should be different from another.
a. Least number of tardy jobs

b. Minimize Maximum Tardiness for any job

c. Minimizing total weighted tardiness.

Summary
The table below shows the summary of sequences for the
different objectives as well as the resulting value from the test done in

Excel. For the first objective, which is to minimize the number of tardy
jobs, the sequence 2-1-8-9-5-3-6-4-11-10-12-7 minimizes the number
of tardy jobs up to 2 jobs only. The second objective, which is to
minimize the maximum tardiness, the sequence 8-2-4-6-1-9-7-3-5-1210-11 results to a maximum of 44 days of tardiness. Lastly, the third
objective, which is to mnimze the total weighted tardiness, the
sequence 2-1-7-4-9-6-8-5-3-10-11-12 was able to minimize the total
weighted tardiness up to 90.
Objective
Minimize the number of tardy
jobs
Minimize the maximum tardiness
for any job
Minimize the total weighted
tardiness
II.

Value
2
44
90

Sequence
2-1-8-9-5-3-6-4-11-1012-7
8-2-4-6-1-9-7-3-5-1210-11
2-1-7-4-9-6-8-5-3-1011-12

Under the objective of minimizing total weighted

tardiness, suppose that you can trade due dates oneday-to-one-day on jobs, and that you can only trade 30
days worth of due dates. Which jobs can you negotiate
for an earlier due date and swapped with other jobs for
later due dates such that you can have minimal total
weighted tardiness?

Using the sequence obtained in the third objective, evaluation as

done as to which jobs needed more time and which jobs have a slack.
The table below shows the amount of slack time that has 0 tardiness
have:

The total slack time is equal to 100 while the total tardiness is
equal to 44. What this implies is that even though the slack time is
enough, the tardiness cannot be eliminated completely as we are only
allowed a total of 30 days. Notice also that the weights for the
remaining tardy jobs is all equal to 1, which means that any tardy job
can be prioritized.
Jobs 1,2,4,6,7,10 and 11s due dates can be shortened so that
Jobs 3,4,8,9 and 12s tardiness can be eliminated of minimized.
Whichever jobs may be chosen, and whatever amount of due dates will
be traded off, will yield a minimum total weighted tardiness that is
equal to 60 days.