PREPARED BY: ANTONY JOSEPH

S7 ME-A
ROLL NO: 4

INTRODUCTION
Scheduling is the allocation of start and finish time to
each particular order
In Flow shop scheduling there are n jobs and m
resources ( machines)
The process sequence of all jobs are the same
If the machines considered in the flow shop problem
are flexible, it is FFS problem
Machine eligibility constraint checks whether the
machine is actually eligible to perform a process in a
job.



OBJECTIVE FUNCTION
Two criterias are
Minimisation of completion time of all jobs in a
group

Minimisation of sum of the difference between the
completion time of each job and the group


We can use two weighting co-efficients 1 and 2
which are defined based on the importance of each
part of the objective function in practical situations
History does matter..
1950s
Johnsons algorithm was proposed
1960s
The branch and bound solution approaches were developed

1970s

The first research related to FFS is proposed by Salvador in 1973

1990s
Emergence of hybrid flow shops and various metaheuristic
21
st

century
Significant progress in developing solution procedures for robotic flow
shops

MATHEMATICAL MODEL

Sets and parameters

The objective function is,








Subjected to:
Constraints

Sample problem

HEURISTICS ALGORITHM
To solve the problem either optimally or approximately, we need to
calculate the objective function value
To calculate the objective function value for a sequence of jobs, each
job has to be assigned to a machine in each stage and the schedule of
processing jobs on each machine should be determined
Heuristics method with 4 levels

LEVEL 1
Procedure of assigning the first job TO first available eligible machine

Done based on an algorithm called, Algorithm 1

Then, in the next three levels, the schedule of processing jobs on machines is
revised to improve the value of the objective function
LEVEL 2
Calculate the last jobs completion time in each group in the last stage(Cmax). Then,
determine the new sequence of jobs regarding the three criteria stated below:
1- The jobs belonging to each group should be processed without any pre-emption by
other jobs of other groups.
2- The sequence of processing groups is determined due to the value of their Cmax, in
ascending order.
3- The sequence of jobs in each group is defined based on the sequence vector of jobs
().
Revise and execute alg. 1 on the last stage.
Calculate new Cmax



LEVEL 3
Starting from the group with high Cmax , delay the process of all jobs
in that group up to the latest possible time without changing the value
of Cmax.

If possible sort the sequence of processing jobs on each machine in
descending order of their processing time

Due to the second part of the objective function, it is better to process
jobs with smaller processing time after the ones with longer processing
time

We can even add a level 4 if we can give a job to the idle time of any
machine if it can increase the second part of the objective function



W
e
tr
y
t
o
r
e
vi
s
e
t
h
e
la
st
st
a
g
e
s
c
h
e
d
u
le
t
o
i
m
p
r
o
v
e
t
h
e
v
al
u
e
o
f
t
h
e
o
b
je
c
ti
v
e
f
u
n
c
ti
o
n

A

v
a
ri
a
b
le
e
n
u
m
e
r
a
t
e
s
t
h
e
p
o
s
si
b
le
b
e
n
e
fi
al
c
h
a
n
g
e
s
i
n
t
h
e
s
c
h
e
d
u
le

A
lg
o
ri
t
h
m

is
t
e
r
m
i
n
a
t
e
d
w
h
e
n
n
o
o
t
h
e
r
b
e
n
e
fi
ci
al
c
h
a
n
g
e
is
p
o
s
si
b
le
RESULT & CONCLUSION
A mathematical model to solve the real world service sector
problem ( Restaurant business) is proposed
An effective method to obtain the optimal solution given the
sequence of job is presented
The so called gap between the theory and practice in scheduling
is narrowing
It can be used for real life application since the idea is initiated
from real world
Restaurant business, Ceramic tile industry, Production and service
industry can be the possible application

REFERENCE
Bita Tadayon, Nasser Salmasi, Flexible flow shop scheduling problem with
machine eligibility constraint and two criteria objective function World
Academy of Science, Engineering and Technology 62 2012

R. Ruiz, FS. Serifoglu, T. Urlings, Modelling realistic hybrid flexible flowshop
scheduling problems, Computers & Operations Research, vol. 35(4), pp. 115175,
2008.

Johnson, S.M., 1954. Optimal two- and three-stage production schedules with setup
times included. Naval Research logistics Quarterly 1, 6168.

Jatinder N.D. Gupta , Edward F. Stafford Jr. Flowshop scheduling research after
five decades European Journal of Operational Research 169 (2006) 699711