MANE4390U Modelling Manufacturing Systems

Instructor: Dr. Sayyed Ali Hosseini

Lecture #10

Chapter 4 - Models & Methods in Shop Scheduling IV

1. Single machine shop scheduling

1.0 1st Scenario: Flow Shop - Single Machine Scheduling (Continue)

1.7 Method #7 Lawlers Algorithm - Minimizing Max Lateness (Lmax) or Minimizing Max
Tardiness (Tmax)
Assumes some jobs have precedence constraints. Our objective is to minimize the maximum
lateness or to minimize the maximum tardiness. As it has been presented in previous lectures,
both lateness and tardiness for job are functions of completion of job ( .

Minimize max lateness

Minimize max tardiness max ,0

As a result, the objective is to keep the maximum of that function (either lateness or tardiness) as
low as possible or in the other word to find where 1

Procedure
1- Start scheduling the jobs from the last one to the first one.
2- At each stage, determine set of jobs which are not precedence for other jobs. Call this set V.
3- Among set V, choose job K to put last where . is the processing
time of remaining jobs to be scheduled and it can also be presented by ( at each step. This
step means that the function or must be calculated for each jobs within the set V
and the job with minimum or will be scheduled last. It must be noted that or
can be lateness or tardiness. It would be better to use lateness as it can have both
negative and positive sign which makes the judgment easier.

1
Example: Schedule the following jobs to minimize maximum lateness

1 2 3 4 5 6 7
4 2 3 3 5 4 5
9 20 12 21 21 25 8

Precedence: 1-3-5, 7-2, 4-6

Step 1: The total processing time for all of the jobs is C 4 2 3 3 5 4 5 26.
The set of jobs which are not precedence for other jobs must be determined at this step. These
jobs are job #2, #5 and #6 so the first set of jobs V 2, 5, 6 . At this step we want to select one
job among this set of jobs and schedule that at the end of the sequence to minimize the maximum
lateness . Regardless of which job is going to be selected, the selected job will be finished at
26 because it is at the end of sequence. Considering putting each of these jobs at the end
of sequence the lateness for each of them is as follows:

2 5 6
2 5 4
20 21 25
: 26 26 26
6 5 1

The above table shows that if job #6 is scheduled at the end of the sequence it will be 1 unit of
time (min, hr., day ) late, while scheduling job #2 or #5 end up with 6 and 5 units of time
lateness. For this reason job #6 which has the minimum lateness at this step is scheduled at the
end of the sequence , , , , , , 6 .

Step 2: At this step we can schedule jobs #2, #5 and #4 so V 2, 4, 5 . Please note that jobs #1
and #3 cannot be scheduled because they have to be processed before job #5. Also, job #7 cannot
be scheduled because it must be done before job #2. The total processing time for all of the jobs
at this step is C 4 2 3 3 5 5 22 because job #6 with processing time of 4 has
been already scheduled. The selected job at this step will be finished at 22. Considering
scheduling each of these jobs at this step the lateness for each of them is as follows:
2
 2 4 5
2 3 5
20 21 21
: 22 22 22
2 1 1

Because the lateness for jobs #4 and #5 are same each of them can be scheduled at this step. Lets
schedule job #4 at this step , , , , , 4, 6 .

Step 3: At this step we can schedule jobs #2, #5 so V 2, 5 .The total processing time for all
of the jobs at this step is C 4 2 3 5 5 19 because job #4 with processing time of
3 is already scheduled. The selected job at this step will be finished at 19. Considering
scheduling each of these jobs at this step the lateness for each of them is as follows:

2 5
2 5
20 21
: 19 19
-1 -2

Because the lateness for jobs #5 is smaller than job #2, job #5 is scheduled at this step
, , , , 5, 4, 6 .

Step 4: At this step we can schedule jobs #2, #3 so V 2, 3 .The total processing time for all
of the jobs at this step is C 4 2 3 5 14 because job #5 with processing time of 5 is
already scheduled. The selected job at this step will be finished at 14. Considering
scheduling each of these jobs at this step the lateness for each of them is as follows:

2 3
2 3
20 12
: 14 14
-6 2

3
Because the lateness for jobs #2 is smaller than job #3, job #2 is scheduled at this step
, , , 2, 5, 4, 6 .

Step 5: At this step we can schedule jobs #3, #7 so V 3, 7 .The total processing time for all
of the jobs at this step is C 4 3 5 12 because job #2 with processing time of 2 is
already scheduled. The selected job at this step will be finished at 12. Considering
scheduling each of these jobs at this step the lateness for each of them is as follows:

3 7
3 5
12 8
: 12 12
0 4

Because the lateness for jobs #3 is smaller than job #7, job #3 is scheduled at this step
, , 3, 2, 5, 4, 6 .

Step 6: At this step we can schedule jobs #3, #7 so V 1, 7 .The total processing time for all
of the jobs at this step is C 4 5 9 because job #3 with processing time of 3 is already
scheduled. The selected job at this step will be finished at 9. Considering scheduling
each of these jobs at this step the lateness for each of them is as follows:

1 7
4 5
9 8
: 9 9
0 1

Because the lateness for jobs #1 is smaller than job #7, job #1 is scheduled at this step and job #7
which is the last job is scheduled at the beginning of the sequence 7, 1, 3, 2, 5, 4, 6 . For such a
sequence the lateness is 3, 0, 0, 6, 2, 1, 1 .

4
Please note that in step 2, if we scheduled job #5 instead of job #4 then the final sequence would
be 7, 1, 3, 2, 4, 5, 6 and the lateness for this sequence is 3, 0, 0, 6, 4, 1, 1 therefore the
maximum lateness which is equal to 1 will not change.

1.8 Method #8 Minimizing Total Tardiness Ti ATC rule

Apparent tardiness cost first (ATC) rule

Tardiness of job max ,0 max ,0

Objective is to minimize total tardiness Ti (or weighted tardiness if jobs have weight wi)

min or min where N is the number of jobs to be scheduled.

ATC rule combines minimum slack first (MS) rule and weighted shortest processing time WSPT
rule. ATC rule is only a heuristic approach,; hence, there is no guarantee that the resulting
schedule provides smallest or . In this method, when machine becomes
available at time , job with highest index value is selected and scheduled.

Note: for case of min when there is no weight for the jobs assume weights 1 for
all jobs.
is the average of processing times of jobs remaining to be scheduled.

is scaling factor. For large rule becomes WSPT rule. Small rule becomes MS rule

How to calculate K?

Step 1 - Calculate Makespan

Step 2 - Calculate due date range factor ,

If is low, it implies narrow range of due dates, high is wide

Step 3 - If 0.5 then 4.5 , else 6 2

5
1.9 Method #9 Minimizing Total Tardiness Ti ATCS rule
This is apparent tardiness cost (ATC) rule but takes setup times for jobs into consideration.

Objective is to minimize total tardiness Ti (or weighted tardiness if jobs have weight wi)

min or min

Calculate index of job upon completion of job at time . Schedule job with highest index
first.

= setup time if do job after job

= average of processing times of jobs remaining to be scheduled.

= average setup times of jobs remaining to be scheduled.

= due date related scaling factor.

= setup time related scaling factor.

What values to choose for , ?

Step 1 - Estimate Makespan =

Step 2 due date tightness factor = 1 , = average of due dates

Step 3 due date range factor

Step 4 setup time severity factor

1
Step 5 K2 . If 0.5 then 4.5 , else 6 2
2 3