Beruflich Dokumente
Kultur Dokumente
The main difference of the flow shop scheduling from the basic single
scheduling is that the inserted idle time may be advantageous in flow shop scheduling. Though the
current machine is free, if the job from the previous m/c is not released to be idle for some time.
Hence inserted idle time on some machine would lead to optimality.
If the sequence of the job is 2-1-4-3, then the corresponding makespan is computed as
shown in fig.
In fig. , the makespan is 25. Also, note the inserted idle times on machine 2 are from 0 to 3,
4 to 8 and 12 to 15.
GANTT CHART FOR SEQUENCE 2-1-4-3
Consider another sequence say 3-4-1-2. The Gantt chart for this sequence is
shown in fig.
The makespan for the schedule in fig. is 26. The m/c 2 has idle time
from 0 to 6 and from 8 to 13.
In the above two sequences, 2-1-4-3 and 3-4-1-2, the first sequence
has lesser makespan. Like this one can enumerate all 4! Sequences then select the sequence
with the minimum makespan as the optimal sequence. Since, n! grows exponentially with n,
one needs some efficient procedure to solve the problem for large size of n, it would be
difficult to solve the problem. Under such situation we can use some efficult heuristic.
• JOHNSON’S PROBLEM:-
In the above table, tij represents the processing time of the job I on m/c j.
• JOHNSON’S ALGORITHM:
STEP 1. Find the the minimum among various ti1, and ti2.
STEP 2. If the minimum processing time requires m/c 2, place the associated job in the
last available position in sequence. Go to step3.
STEP 2B. If the minimum processing time requires m/c 2, place the associated job in the
last available position in sequence. Go to step3.
STEP3. Remove the assigned job from consideration and return to step 1 until all positions
in sequence are fill.
Consider the following two m/c and six job flow shop
scheduling problem. Using Johnson’s algorithm, obtain the optimal which will minimize
the makespana
SOLUTION:
Time-in on M\c 2=max [M\c 1 time-out of the current job, M/c 2 time-out of the previous
job]
PROCESSING TIME
M/C-1 M/C-2
Job time-in time-out time-in time-out idle time on m/c
2
2 o 2 2 5 2
5 2 10 10 19 5
3 10 23 23 37 4
6 23 35 37 48 0
1 35 40 48 52 0
4 40 50 52 53 0
The makespan for this schedule is 53. The makespan can aloes be
obtained using Gantt chart which is shown in fig.
The objective is to obtain optimal sequence for the data given in the
table the makespan is to be determined for the optimal sequence by using the data of the
original problem shown in table
Let,
Σ1 tj1
j€δ
Moreover suppose that a particular job K is the last job in the sequence.
Under this situation, after the job K is process on m/c 1, it will take atleast time units on m/c
2 and m/c 3 before the whole schedule is completed.
In the most favorable situation the last job.
(a) encounters no delay between the completion of an the start of its diredt successor
(b) has the minimum sum (tj2 + tj3) among jobs j € δ1.
Similar reasoning applied to the processing on the processing, yet required on m/c 2 yields a
second lower bound.
b3 = q3 + Σ1 tj3
• CDS HEURISTIC:-
The CDS heuristic corresponds to multistage use of johnson’s rule to a new problem formed
from the original with processing time.
At stage 1,
t1j1 = tj1 and t1j2 = tjm
in other words, jonson’s rule is applied to the first and m th opetion
and intermediate operation are ignored.
At stage 2,
t2j1 = tj1 + tj2, t2j2 = tjm + tjm-1,
that is Johnson’s rule is applied to the sum of the first two and the last
two operation processing times. In general at stage i.
At stage 2,
i i
2 i
t j1 = ∑ tjk, and t j2 = ∑ tj m-1
k=1 k=1
for each stage I (I = 1,2,…., m-1), the job order obtained is used to
calculate a makeswpan for the original problem. After m-1, stages the best makerpan among
the m-1 schedules is identified.
• JOB SHOP SCHEDULING:-
Unlike the flow shop model, there is initial m/c that performs only the
first operation of a job, nor is there a terminal m/c that performs only the last operation of a
job.
In the flow shop an operation number in the operation sequence of a
job may be same as the position number of the required m/c. hence there is no need to
distinguish between them. But in the in the job shop case different jobs will have different
operation sequences. So we cannot assume a straight flow for the job shop problem will be
described with triplet where k is the required m/c for processing the jth operation of the ith
job.
Consider the following data of a job shop scheduling involving four
jobs three operation and hence three machines.
The first table consists of operation processing times and the second table consist of
operation sequences of the jobs. The set of machines required for a given job constitute a
routing.
For example, job 4 has routing of 1-2-3.
GANTT CHRAT
• Types of schedules:-
The set of active schedules dominates the set of semi active schedule
in terms of optimizing any regular measure of performance. So it is sufficientto consider
only active schedules.
• SCHEDULE GENERATION:-
In job shop scheduling schedule is generated by taking the various aspect which we
discussed earlier such that the final schedule has a better value for an assumed measure of
performance. So the process of schedule generation is considered to be very important
phase in job shop scheduling. A generation procedure can be classified as a single-pass
mechanism or an adjusting mechanism.
fixed. Therefore a full shedder can be generated with a single-pass through the list of
operation are added to the scheduling.
In these procedures an operation will be considered only when all of
its predecessors have been schedule. The number of stages for a one-pass procedure is equal
to the number of operations or nm(no. of jobs x no. of operation)