Scribd
Upload
47 views9 pages

Consider A Single Machine Problem With Precedence Constraints and Minimizing Maximum Lateness Objective - Which Algorithm Should Be Used ?

This document discusses Lawler's algorithm for solving single machine scheduling problems with precedence constraints and a maximum lateness objective. Lawler's algorithm assigns jobs to positions starting from the last position and working backwards. It identifies candidate jobs that can be scheduled in each position based on precedence constraints. It then schedules the candidate job with the minimum lateness value for that position. The document provides an example problem and steps through applying Lawler's algorithm to find the optimal job sequence. It ends by asking the audience to identify the objective of the example problem presented.

Uploaded by

JobinSiby
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
47 views9 pages

Consider A Single Machine Problem With Precedence Constraints and Minimizing Maximum Lateness Objective - Which Algorithm Should Be Used ?

This document discusses Lawler's algorithm for solving single machine scheduling problems with precedence constraints and a maximum lateness objective. Lawler's algorithm assigns jobs to positions starting from the last position and working backwards. It identifies candidate jobs that can be scheduled in each position based on precedence constraints. It then schedules the candidate job with the minimum lateness value for that position. The document provides an example problem and steps through applying Lawler's algorithm to find the optimal job sequence. It ends by asking the audience to identify the objective of the example problem presented.

Uploaded by

JobinSiby
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Consider a single machine problem

with precedence constraints and


minimizing maximum lateness
objective . Which algorithm should
be used ?

Lawlers Algorithm for Precedence


Constraints
General scheme : First assigns a job to the last position, then a job
to the position next to last, and so on.
Candidate job for a position : Due to precedence constraints, not all
the jobs are candidates for a position. For example, if a job has a
successor, the job cannot be assigned to the last position. Hence,
candidates for the last position are the ones without any successor
Which job to assign?
Eliminate all the jobs which are previously assigned.
Identify the candidates - jobs that have no successor or have
successors all previously assigned.
Among all the candidates, schedule the one with the minimum
lateness

Example

Job

Processing time

Due date

11

Step1: find the job scheduled last(sixth)


Not predecessor
Job

Processing time

Due date

11

t =2+3+4+3+2+1=15
Tardiness

15-9=6

15-11=4

15-7=8

Step2: find the job scheduled fifth


Job

Processing time

Due date

t =15-2=13

Tardiness

Not predecessor

13-9=4

13-7=6

Step3: find the job scheduled fourth


Not predecessor
Job

Processing time

Due date

7
2

9-6=3

9-7=2

t =13-4=9
Tardiness

Step4: find the job scheduled third


Job

Processing time

Due date

t =9-1=8

Tardiness

Not predecessor

8-6=2

8-7=1

Lawlers Algorithm(continue---)

Step5: find the job scheduled second


Not predecessor

Job
1
2
4
6
3
5

Job

Processing
time

Due date

The optimal sequence: 1-2-4-6-3-5

Processing
time

Flow
time

Due date

Tardiness

2
3
3
1
4
2

2
5
8
9
13
15

3
6
7
7
9
11

0
0
1
2
4
4

Maximum tardiness

QUESTION FOR AUDIENCE- Identify the objective of the


problem

A computer systems consulting company is under contract to


carry out six projects, all with deadliness assured in days from
now. The consultants are a small group and they work together on
each project, so that the project will be started and completed
sequentially. Under the terms of contract, the consultants will
receive Rs. 24,000 for each project completed on time, but they
will incur Rs. 40,000 in penalties for each project completed late.
Each project has an, associated duration, which is the anticipated
number of days required to carry out the project as shown below.

Job

Due date

15

23

20

30

Processing time

10

10

Other Advanced topics

1-Beam search
2-Simulated annealing
3-genetic algorithms
4-tabu search
5-neural networks.

THANK YOU FOR YOUR TIME AND


ATTENTION
Let all things be done decently and
in order. I Corinthians

You might also like