See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/314895274

A Study of Algorithm for the Optimal Scheduling of the Job Sequencing

Problem

Article in International Journal of Scientific Research · May 2013

DOI: 10.15373/22778179/MAY2013/204

CITATIONS READS

0 1,751

1 author:

Pv Ubale
GS Science, Arts and Commerce College, Khamgaon
30 PUBLICATIONS 31 CITATIONS

SEE PROFILE

All content following this page was uploaded by Pv Ubale on 09 September 2017.

The user has requested enhancement of the downloaded file.

 Volume : 2 | Issue : 5 | May 2013 • ISSN No 2277 - 8179
Research Paper

Statistics
A Study of Algorithm for the Optimal KEYWORDS : Branch & Bounding
method, job processing time, flow shop
Scheduling of the Job Sequencing Problem scheduling problem

Dr. P. V. Ubale Associate professor in Statistics, G.S.Sci.,Arts, & Comm. College Khamgaon

ABSTRACT This paper studies flow shop scheduling problem in which job processing time on each machine are given.
The objective of the study is to get optimal sequence of jobs in order to minimize the total elapsed time. The
given paper focuses on to the study of the algorithm for finding optimal scheduling of the job sequencing problem. The method is il-
lustrated with the help of numerical example.

1] Introduction uling problem. A branch and bounding scheme is given as below.

Many applied & experimental situations which generally arise
in manufacturing concern to get an optimal schedule of jobs in Let S0 denotes root node at level 0. At level 1 the node S0 is
set of machines. Sequencing has been a topic of considerable partition in to n different sub problems {S11, S21, S31,…., Sn1 } by
research in the past few years. Sequencing is a technique to or- assigning each job to the last position in the sequence. Clearly
der the jobs in a particular sequence. There are different type these sub problems are smaller than S0 and each S11 is a par-
of sequencing which are followed in industries such as first in tially solved version of S0. Next each of the sub problems can be
first out basis, priority basis, job size basis and processing time partitioned further. For instance S21 can be partitioned into S211,
basis. S232,S242 ….., S2n2. In S232 job 2 & 3 can occupy the last two posi-
tions in the sequence. At level k then each sub problems con-
By scheduling we assign a particular time for completing a par- tains k fixed positions in the sequence and can be partitioned in
ticular job. The main objective of scheduling is to arrive at a po- to (n-k) sub problems.
sition where we will get minimum processing time.
At any point of time we compare the lower bounds of all the ter-
Flow shop sequencing problem is commonly defined as deter- minal nodes and select the node with minimum lower bound for
mining the sequence in which n jobs is to be processed on m ma- further branching. If there is a tie on the minimum lower bound
chines in order to minimize the total elapsed time. In flow shop then select the node at the lower level for further branching. If
scheduling the objective is to obtained a sequence of jobs which the node with the minimum lower bound lies at the (n-1)th level
when processed in a fixed order of machines will optimize some then the optimality is reached.
well defined criteria.
3] Notations and terminology used in Branch and Bounding
The classical flow shop scheduling problem is one of the most method
well known scheduling problems. The problem can be de- Let σ denotes partial permutation occurring at the beginning of
scribed as follows. the sequence.

There are a set of jobs and set of machines. Each job consist of σ’ denotes set of jobs that are not contained in the partial per-
chain of operation, each of which needs to be processed dur- mutation.
ing an uninterrupted time period of a given length on a given
machine. Each machine can process at most one operation at a t1, t2,t3 denotes the completion time of the last job on machine 1,
time. A schedule is an allocation of operation to time intervals machine 2, machine 3 respectively among the jobs in σ.
of the machine. The problem is to find schedule of minimum
length. Hence a lower bound on the make span with respect to machine
1 is
It is a typical combinatorial optimization problem where each
job has to go through processing in each and every machine. …..(3.1)
The number of possible schedules of the flow shop scheduling
problems involving n jobs and m machines is (n!)m. The optimal The second lower bound on machine 2 is given by
solution for the problem is to find the sequence of jobs on each
machines in order to complete all the jobs on all the machines
in the minimum total time provided each job is processed on
machines 1,2,3,…..,m in that order. In this paper our main focus The third lower bound on machine 3 is given by
on to implement branch and bounding method to the solution of
flow shop scheduling problem.
The final lower bound for σ is
2] Branch and bounding technique used in flow shop sched-
uling problem
The Branch and Bounding algorithm are time intensive tree
based exploration methods for solving to optimality combinato-
rial optimization problem. In order to use the branch and bound
technique one must be able to describe the problem as a tree in
which each node represents a partial solution. The first node in
the related tree structure is called as the root node. From this Where Ai,Bi & Ci are the processing times on machine I, machine
node there are n branches corresponding to the n possible sub II, machine III respectively.
problems. Branching is the process of partitioning a large prob-
lem into two or more sub problem and bounding is the process 4] Application of Branch and Bounding method to flow shop
of calculating lower bound on the optimal solution of the given scheduling problem
problem. Let us explain the application of branch and bounding method
to flow shop scheduling problem with the help of numerical ex-
In this section application of branch and bounding technique is ample. Consider 4 jobs has to be processed on 3 machines with
applied to obtain an optimal sequence for the flow shop sched- their processing time is given below.

594 IJSR - INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH

Research Paper Volume : 2 | Issue : 5 | May 2013 • ISSN No 2277 - 8179

Job Machine I Machine II Machine III b2 = 33 + 27 + 06 = 66

1 10 15 23
2 8 10 7
3 12 7 10 b3 = 56 + 16 = 72
4 15 20 6
We start with the root node LB(21) = max { 62, 66, 72} = 72

At the root node σ = {0} and σ’ = {1,2,3,4} The lower bound B for
the root node = 0. The set of nodes created under the root node,
S0 is S11,S21,S31,S41 Initially (q1,q2,q3) = (0,0,0) Node S232 σ = { 2,3} σ’ = {1,4}

The lower bound calculations using the equations (t1,t2,t3) = (20, 27, 37)
(3.1),(3.2),(3.3) are as given below.
b1 = 20 + 25 + 26 = 71
First level
Node S11 σ = {1} σ’={2,3,4} b2 = 27 + 35 + 06 = 68

(t1,t2,t3) = (10,25,48) b3 = 37 + 29 = 66

b1 = 10 +35 + 17 = 62 LB(23) = max {71, 68, 66} = 71

b2 = 25 +37 +06 = 68 Node S242 σ = { 2,4} σ’ = {1, 3}

b3 = 48 + 23 = 71 (t1,t2,t3) = (23, 43, 49)

LB(1) = max { 62, 68, 71} = 71 b1 = 23 + 22 + 17 = 62

Node S21 σ = {2} σ’={1,3,4} b2 = 43 + 22 + 10 = 75

(t1,t2,t3) = (8, 18, 25) b3 = 49 + 33 = 82

b1 = 8 + 37 + 17 = 62 LB(24) = max { 62, 75, 82} = 82

b2 = 18 + 42 +06 = 66 S212 S232 S242

b3 = 25 + 39 = 64 72 71 82

LB(2) = max { 62, 66, 64} = 66 The node with minimum lower bound on the second level is the
node S232. So branch from this node.
Node S31 σ = {3} σ’={1,2,4}
Third level
(t1,t2,t3) = (12, 19, 29) Node S2313 σ = { 2,3,1} σ’ = {,4}

b1 = 12 + 33 + 17 = 62 (t1,t2,t3) = (30, 45, 68)

b2 = 19 + 45 + 06 = 70 b1 = 30 + 15 + 26 = 71

b3 = 29 + 36 = 65 b2 = 45 + 20 + 06 = 71

LB(3) = max { 62, 70, 65} = 70 b3 = 68 + 6 = 74

Node S41 σ = {4} σ’={1, 2, 3} LB(231) = max {71, 71, 74} = 74

(t1,t2,t3) = (15, 35, 41) Node S2343 σ = { 2,3,4} σ’ = {1}

b1 = 15 + 30 + 17 = 62 (t1,t2,t3) = (35, 55, 61)

b2 = 35 + 32 + 07 = 74 b1 = 35 + 10 + 38 = 83

b3 = 41 + 40 = 81 b2 = 55 + 15 + 23 = 93

LB(4) = max { 62, 74, 81} = 81 b3 = 61 + 23 = 84

In the first level nodes with lower bounds are as given below LB(234) = max {83, 93, 84} = 93
S11 S21 S31 S41
S2313 S2343
71 66 70 81
74 93
The node with minimum lower bound is S21 so branch from this
node on the second level. The node with minimum lower bound on the third level is on
the node S2313 lies at the (n-1)th level hence the optimality is
Second level reached to the given problem. Hence the optimal sequence for
Node S212 σ = { 2,1} σ’ = {3,4} the given flow shop scheduling problem is 4,2,3,1.

(t1,t2,t3) = (18, 33, 56) The whole procedure is summarized in the following table.

b1 = 18 + 27 + 17 = 62 Table 1

IJSR - INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH 595

 Volume : 2 | Issue : 5 | May 2013 • ISSN No 2277 - 8179
Research Paper

Partialse- (t1,t2,t3) Lower

Maximum
quence bounds
lower
(b1,b2,b3)
bound
LB(σ)
1 (10, 25, 48) (62, 68, 71) 71
2 (8, 18, 25) (62, 66, 64) 66*
3 (12, 19, 29) ( 62, 70, 65) 70
4 (15, 35, 41) (62, 74, 81) 81
2,1 (18, 33, 56) (62, 66, 72) 72
2,3 (20, 27, 37) (71,68,66) 71*
2,4 (23, 43, 49) (62, 75, 82) 82
2,3,1 (30, 45, 68) (71, 71, 74) 74*
2,3,4 (53, 55, 61) (83, 93, 84) 93
The branching and bounding tree for whole procedure is given
in the following figure.

REFERENCE 1] Ignall E and Schrage L (1965): Application of the Branch and Bound technique to some flow shop scheduling problem, Operations research,
Vol. 13, 400-412. | | 2] Yang D.L and Chern M.S. (2000): Two machine flow shop group scheduling problem, Computers and operations research
Vol. 27, No. 10, 975-985. | | 3] R. Paneer selvam (2010): Operations Research PHI leaning private limited New Delhi. | | 4] Deepak Gupta, Payal Singla, Harminder Singh (2011):
Application of Branch and Bound method for optimal two stage flow shop scheduling problem with Group job restriction, Journal of Engineering and applications, vol 1, No. 5, 1-4. |
| 5] P.V.Ubale (2011): Optimal scheduling for flow shop scheduling problem with transportation time, International journal of management studies, statistics & applied economics,
Vol. 1 No. 1 113-118. |

596 IJSR - INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH

View publication stats