Scribd
Upload
428 views5 pages

Job Sequencing With The Deadline

The document describes the job sequencing with deadlines problem. It defines a feasible solution as a set of jobs that can each be completed by their deadline. The optimal solution is the feasible solution that yields the highest total profit. It provides an example problem and lists the feasible solutions and their profits. Finally, it describes a greedy algorithm to find the optimal solution by considering jobs in non-increasing profit order while ensuring the resulting sequence is feasible.

Uploaded by

Abhi
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
428 views5 pages

Job Sequencing With The Deadline

The document describes the job sequencing with deadlines problem. It defines a feasible solution as a set of jobs that can each be completed by their deadline. The optimal solution is the feasible solution that yields the highest total profit. It provides an example problem and lists the feasible solutions and their profits. Finally, it describes a greedy algorithm to find the optimal solution by considering jobs in non-increasing profit order while ensuring the resulting sequence is feasible.

Uploaded by

Abhi
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/ 5

JOB

JOBSEQUENCING
SEQUENCINGWITH
WITH
DEADLINES (Contd..)
DEADLINES
•The
Sr.No.A problem
feasible
JOB SEQUENCING WITH
Feasible solution
Solution is stated
Processing
isasabelow.
Sequence
subsetProfit
ofvalue
jobs J such that
each job is completed by its deadline.
• There
(i) (1,2)
•(ii) An (1,3)
DEADLINES
are n jobs to
optimal solution
• Each job i has a deadline
(iii)maximum
(1,4)
•(iv)Pi is(2,3)
be processed
(2,1)

profit (4,1)
earned iff the
value.
job
is
(1,3) or (3,1)

is
a
110 on a machine.
feasible
di≥ 0115
solution with
and profit pi≥0 .
127 is the optimal one
completed by its deadline.
Example : Let n (2,3) = 4, (p1,p2,p325,p4) = (100,10,15,27),
• The
(v)
(d
(3,4)
,djob,d is
,d ) =
(4,3) if it is processed
completed
(2,1,2,1)
42 on a machine
(vi)
(vii)
The problem is stated as below.
1 2
(1) 3
for unit time.
(2)
4 (1)
(2)
100
10
• Only(3)one machine
(viii) (3)is available15for processing jobs.
(ix)
• There are n jobs to be processed on a machine.
• Only(4)one job is processed(4) at a27time on the machine.
2
3

• Each job i has a deadline di≥ 0 and profit pi≥0 .


1

• Pi is earned iff the job is completed by its deadline.


• The job is completed if it is processed on a machine
for unit time.
• Only one machine is available for processing jobs.
• Only one job is processed at a time on the machine.
1
JOB SEQUENCING WITH
DEADLINES (Contd..)
• A feasible solution is a subset of jobs J such that
each job is completed by its deadline.
• An optimal solution is a feasible solution with
maximum profit value.
Example : Let n = 4, (p1,p2,p3,p4) = (100,10,15,27),
(d1,d2,d3,d4) = (2,1,2,1)

2
JOB SEQUENCING WITH
DEADLINES (Contd..)
Sr.No. Feasible Processing Profit value
Solution Sequence
(i) (1,2) (2,1) 110
(ii) (1,3) (1,3) or (3,1) 115
(iii) (1,4) (4,1) 127 is the optimal one
(iv) (2,3) (2,3) 25
(v) (3,4) (4,3) 42
(vi) (1) (1) 100
(vii) (2) (2) 10
(viii) (3) (3) 15
(ix) (4) (4) 27

3
GREEDY ALGORITHM TO
OBTAIN AN OPTIMAL SOLUTION
• Consider the jobs in the non increasing
order of profits subject to the constraint that
the resulting job sequence J is a feasible
solution.
• In the example considered before, the non-
increasing profit vector is
(100 27 15 10) (2 1 2 1)
p1 p4 p3 p2 d1 d4 d3 d 2
4
GREEDY ALGORITHM TO OBTAIN AN
OPTIMAL SOLUTION (Contd..)

J = { 1} is a feasible one
J = { 1, 4} is a feasible one with processing
sequence ( 4,1)
J = { 1, 3, 4} is not feasible
J = { 1, 2, 4} is not feasible
J = { 1, 4} is optimal

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy