Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
|
|
|
.
|
\
|
+
|
|
|
.
|
\
|
+ >
=
=
=
=
n
1 j
j 2 j 1
n ,.., 1 j
n
1 j
j 1 j 2
n ,.., 1 j
max
p p min , p p min max ) OPT ( C
FLOW SHOPS: JOHNSON'S RULE 11
JOHNSONS ALGORITHM
LET U = {1, 2,..., n} BE THE SET OF UNSCHEDULED JOBS.
k =1,
l = n,
Ji = 0, i = 1, 2, ..., n.
STEP 1: IDENTIFICATION OF SMALLEST PROCESSING TIME
IF U = C, GO TO STEP 4.
LET
)
`
=
= =
j 2
n ,.., 1 j
, j 1
n ,.., 1 j
* j * i
p min p min min p
IF i* = 1 GO TO STEP 2; OTHERWISE GO TO STEP 3.
FLOW SHOPS: JOHNSON'S RULE 12
JOHNSONS ALGORITHM
(CONTINUED)
STEP 2: SCHEDULING A JOB ON EARLIEST POSITION
SCHEDULE JOB j* IN THE EARLIEST AVAILABLE POSITION: Jk
= j*.
UPDATE k: k = k + 1.
REMOVE THE JOB FROM THE SCHEDULABLE SET, U = U {j*}.
GO TO STEP 1.
STEP 3: SCHEDULING A JOB ON LATEST POSITION
SCHEDULE JOB j* IN THE EARLIEST AVAILABLE POSITION: Jl
= j*.
UPDATE l: l = l - 1.
REMOVE THE JOB FROM THE SCHEDULABLE SET, U = U {j*}.
GO TO STEP 1.
FLOW SHOPS: JOHNSON'S RULE 13
JOHNSONS ALGORITHM
(CONTINUED)
STEP 4: SEQUENCE OF JOBS
THE SEQUENCE OF JOBS IS GIVEN BY Ji, WITH J1 THE FIRST JOB,
AND SO FORTH.
FLOW SHOPS: JOHNSON'S RULE 14
Fm||Cmax
Fm||Cmax IS A STRONGLY NP-HARD PROBLEM.
AN EXTENSION OF JOHNSONS ALGORITHM YIELDS AN
OPTIMAL SOLUTION FOR THE F3||Cmax PROBLEM WHEN THE
MIDDLE MACHINE IS DOMINATED BY EITHER THE FIRST OR
THIRD MACHINE.
FLOW SHOPS: JOHNSON'S RULE 15
MACHINE DOMINANCE: F3||Cmax
A MACHINE IS DOMINATED WHEN ITS LARGEST PROCESSING
TIME IS NO LARGER THAN THE SMALLEST PROCESSING TIME
ON ANOTHER MACHINE.
FOR F3||Cmax PROBLEM:
)
`
s
j 3 j 1
j
j 2
p min , p min max p
WHICH IMPLIES THAT MACHINE 2 (DOMINATED MACHINE) CAN
NEVER CAUSE A DELAY IN THE SCHEDULE.
FLOW SHOPS: JOHNSON'S RULE 16
JOHNSONS ALGORITHM FOR 3 MACHINES
FOR F3||Cmax, WHENEVER MACHINE 2 IS DOMINATED, i.e.,
OR
} p { max } p { min
j 2
j
j 1
j
>
SOLVING AN EQUIVALENT TWO-MACHINE PROBLEM WITH
PROCESSING TIMES:
p
1j
= p
1j
+ p
2j
AND p
2j
= p
2j
+ p
3j
GIVES THE OPTIMAL MAKESPAN SEQUENCE TO THE
DOMINATED THREE-MACHINE PROBLEM.
} p { max } p { min
j 2
j
j 3
j
>
FLOW SHOPS: JOHNSON'S RULE 17
EXAMPLE: F3||Cmax
CONSIDER F3||ECmax WITH THE FOLLOWING JOBS:
JOB 1 2 3 4 5
p1j 4 9 8 6 5
p2j 5 6 2 3 4
p3j 8 10 6 7 11
= } p { min
j 1
j
= } p { max
j 2
j
= } p { min
j 3
j
FLOW SHOPS: JOHNSON'S RULE 18
EXAMPLE: PROCESSING TIMES, DUMMY
MACHINES
JOB 1 2 3 4 5
p1j 4 9 8 6 5
p2j 5 6 2 3 4
p3j 8 10 6 7 11
p'1j
p'2j
SEQUENCE:
FLOW SHOPS: JOHNSON'S RULE 19
EXAMPLE: SCHEDULE
SEQUENCE:
1 4 5 2 3
JOB 1 2 3 4 5
p1j 4 9 8 6 5
p2j 5 6 2 3 4
p3j 8 10 6 7 11
t
M1
M2
M3