SlideShare uma empresa Scribd logo
1 de 6
Baixar para ler offline
Journal of Information Engineering and Applications                                    www.iiste.org
ISSN 2224-5782 (print) ISSN 2225-0506 (online)
Vol 2, No.1, 2012




   Branch and Bound Technique for three stage Flow Shop
   Scheduling Problem Including Breakdown Interval and
                   Transportation Time
                                          Deepak Gupta*
Department of Mathematics Maharishi Markandeshwar University Mullana, Ambala (India)
            * E-mail of the corresponding author: guptadeepak2003@yahoo.co.in

Abstract

This paper deals with minimization of the total elapsed time for nx3 flow shop
scheduling problem in which the effect of breakdown interval and the transportation
time are considered. A Branch and Bound technique is given to optimize the
objective of minimize the total elapsed time. The algorithm is very simple and easy to
understand and, also provide an important tool for decision makers to design a
schedule. A numerical illustration is given to clarify the algorithm.
Keywords: Flow shop scheduling, Processing time, Transportation time, Branch and Bound
Technique, Optimal sequence.
1. Introduction:
        Scheduling problems are common occurrence in our daily life e.g. ordering of
jobs for processing in a manufacturing plant, programs to be run in a sequence at a
computer center etc. Such problems exist whenever there is an alternative choice in
which a number of jobs can be done. Now-a-days, the decision makers for the
manufacturing plant have interest to find a way to successfully manage resources in
order to produce products in the most efficient way. They need to design a production
schedule to minimize the flow time of a product. The number of possible schedules in
a flow shop scheduling problem involving n-jobs and m-machines is ( n !)m . The
optimal solution for the problem is to find the optimal or near optimal sequence of
jobs on each machine in order to minimize the total elapsed time.Johnson (1954) first
of all gave a method to minimise the makespan for n-job, two-machine scheduling
problems. The scheduling problem practically depends upon the important factors
namely, Transportation time, break down effect, Relative importance of a job over
another job etc. These concepts were separately studied by Ignall and Scharge (1965),
Maggu and Dass (1981), Temiz and Erol(2004),Yoshida and Hitomi (1979), Lomnicki
(1965), Palmer (1965) , Bestwick and Hastings (1976), Nawaz et al. (1983) , Sarin and
Lefoka (1993) , Koulamas (1998) , Dannenbring (1977) , etc.
 Singh T.P. and Gupta Deepak (2005)studied the optimal two stage production
schedule in which processing time and set up time both were associated with
probabilities including job block criteria. Heydari (2003)dealt with a flow shop
scheduling problem where n jobs are processed in two disjoint job blocks in a string
consists of one job block in which order of jobs is fixed and other job block in which
order of jobs is arbitrary. Lomnicki (1965) introduced the concept of flow shop
scheduling with the help of branch and bound method. Further the work was developed
by Ignall and Scharge (1965), Chandrasekharan (1992), Brown and Lomnicki(1966) ,
with the branch and bound technique to the machine scheduling problem by introducing
different parameters. The concept of transportation time is very important in scheduling
when the machines are distantly situated. The break down of the machines have
significant role in the production concern. The effect of break down interval is
important as there are feasible situations where machine during process may get sudden


                                              24
Journal of Information Engineering and Applications                               www.iiste.org
ISSN 2224-5782 (print) ISSN 2225-0506 (online)
Vol 2, No.1, 2012

break down due to either failure of any component of machine or the machines are
supposed to stop their working for a certain interval of time due to some external
imposed policy such as electric cut/shortage due to government policy. The working of
machine no longer remains continuous and is subject to break-down for a certain
interval of time. This paper extends the study made by Ignall and Scharge (1965) by
introducing the concept of transportation time and break down interval. Hence the
problem discussed here is wider and has significant use of theoretical results in process
industries.
2 Practical Situation
Many applied and experimental situations exist in our day-to-day working in factories
and industrial production concerns etc. In many manufacturing companies different
jobs are processed on various machines. These jobs are required to process in a
machine shop A, B, C, ---- in a specified order. When the machines on which jobs are
to be processed are planted at different places, the transportation time (which includes
loading time, moving time and unloading time etc.) has a significant role in
production concern. The break down of the machines (due to delay in material,
changes in release and tails date, tool unavailability, failure of electric current, the
shift pattern of the facility, fluctuation in processing times, some technical
interruption etc.) have significant role in the production concern.
3 Notations:
We are given n jobs to be processed on three stage flowshop scheduling problem and
we have used the following notations:
 Ai     :       Processing time for job i on machine A
 Bi     :       Processing time for job i on machine B
 Ci     :       Processing time for job i on machine C
 Cij    :       Completion time for job i on machines A, B and C
 ti     :       Transportation time of ith job from machine A to machine B.
 gi     :       Transportation time of ith job from machine B to machine C.
 Sk    :        Sequence using johnson’s algorithm
 L      :       Length of break down interval.
 Jr     :       Partial schedule of r scheduled jobs
 Jr′    :       The set of remaining (n-r) free jobs
4 Mathematical Development:
Consider n jobs say i=1, 2, 3 … n are processed on three machines A, B & C in the
order ABC. A job i (i=1,2,3…n) has processing time Ai , Bi & Ci on each machine
respectively, assuming their respective probabilities pi , qi & ri such that 0 ≤ pi ≤ 1,
Σpi = 1, 0 ≤ qi ≤ 1, Σqi = 1, 0≤ ri ≤ 1, Σri = 1. Let ti and gi be the transportation time of
machine A to machine B and machine B to machine C respectively. The mathematical model
of the problem in matrix form can be stated as :




                                              25
Journal of Information Engineering and Applications                                      www.iiste.org
ISSN 2224-5782 (print) ISSN 2225-0506 (online)
Vol 2, No.1, 2012




                        Jobs Machine A                     Machine B         Machine C

                                                     ti                gi
                              i             Ai                   Bi             Ci

                              1             A1       t1          B1    g1       C1
                              2             A2       t2          B2    g2       C2
                              3             A3       t3          B3    g3       C3
                              4             A4       t4          B4    g4       C4
                              -             ----     ---         ---   ---      ----

                              -             --       --          --    ---      --
                              n             An       tn          Bn    gn       Cn


                                                   Tableau – 1
Our objective is to obtain the optimal schedule of all jobs which minimize the total
elapsed time whenever the effect of break down interval (a, b) is given, using branch
and bound technique.
5 Algorithm:
Step1: Calculate
(i) g1 = t ( J r ,1) + ∑ Ai + min( Bi + Ci )
                                      ′
                                  i∈J r
                        ′
                    i∈J r
(ii) g2 = t ( J r , 2) + ∑ Bi + min(Ci )
                                        ′
                                    i∈J r
                          ′
                      i∈ jr
(iii) g3= t ( J r ,3) + ∑ Ci
                          ′
                      i∈ jr
Step 2: Calculate g = max [g1, g2, g3] We evaluate g first for the n classes of
permutations, i.e. for these starting with 1, 2, 3………n respectively, having labelled
the appropriate vertices of the scheduling tree by these values.
Step 3: Now explore the vertex with lowest label. Evaluate g for the (n-1) subclasses
starting with this vertex and again concentrate on the lowest label vertex. Continuing
this way, until we reach at the end of the tree represented by two single permutations,
for which we evaluate the total work duration. Thus we get the optimal schedule of the
jobs.
Step 4: Prepare in-out table for the optimal sequence obtained in step 4 and read the
effect of break down interval (a, b) on different jobs.
Step 5: Form a modified problem with processing times p′ , p′ & p′ on machines A,
                                                             i1  i2    i3
B & C respectively. If the break down interval (a, b) has effect on job i then p′ =pi1 + L
                                                                                i1
, p′ = pi2 + L and p′ = pi3 + L
    i2                 i3              where L = b – a, the length of the break down
interval.
If the break down interval (a, b) has no effect on job i then p′ =pi1 , p′ = pi2 and p′ = pi3.
                                                               i1        i2           i3




                                                            26
Journal of Information Engineering and Applications                            www.iiste.org
ISSN 2224-5782 (print) ISSN 2225-0506 (online)
Vol 2, No.1, 2012

Step 6: Repeat the procedure to get the optimal sequence for the modified scheduling
problem using step1 to step 3. Compute the in-out table and get the minimum total
elapsed time.
6 Numerical Example:
Consider 5 jobs 3 machine flow shop problem. processing time of the jobs on each
machine is given. Our objective is to obtain the optimal schedule of all jobs which
minimize the total elapsed time whenever the effect of break down interval (25, 35) is
given.


               Jobs Machine A                    Machine B         Machine C

                 I             Ai           ti      Bi        gi      Ci

                1              15           4       20        5       16

                2              25           7       10        8       5

                3              10           6       12        3       12

                4              18           9       15        7       18

                5              16           2       25        6       3


                                        Tableau – 2
Solution:Step1: Calculate
(i) g1 = t ( J r ,1) + ∑ Ai + min( Bi + Ci )
                                    ′
                                i∈J r
                         ′
                     i∈J r
(ii) g2 = t ( J r , 2) + ∑ Bi + min(Ci )
                                        ′
                                    i∈J r
                           ′
                       i∈ jr
(iii) g3= t ( J r ,3) + ∑ Ci
                           ′
                       i∈ jr
For J1 = (1).Then J′(1) = {2,3,4}, we get g1 = 43 , g2 = 37 & g3 = 43
g = max(g1, g2, g3) = 43 similarly, we have LB(2)= 51 , LB(3)= 52 and LB(4)= 58
Step 2 & 3: Now branch from J1 = (1). Take J2 =(12). Then J′2={3,4} and LB(12) = 51
Proceeding in this way, we obtain lower bound values on the completion time on
machine C as shown in the tableau- 3
Step 4 :Therefore the sequence S1 is 1-3-4-2 and the corresponding in-out table and
checking the effect of break down interval (25, 35) on sequence S1 is as in tableau4:
Step 5: The modified problem after the effect of break down interval (25,35) with
processing times A′i, B′i and C′i on machines A, B & C respectively is as in tableau-5:
Step 6: Now, on repeating the procedure to get the optimal sequence for the modified
scheduling problem using step 1 to step 3, we obtain lower bound values on the


                                                         27
Journal of Information Engineering and Applications                          www.iiste.org
ISSN 2224-5782 (print) ISSN 2225-0506 (online)
Vol 2, No.1, 2012

completion time on machine C as shown in the tableau- 6 we have get the sequence
S2 : 3-1-4-5-2. Compute the in-out table for S2 and get the minimum total elapsed time
as in tableau-7.
Hence the total elapsed time is 131 units.
References :
    [1] Brown, A.P.G. and Lomnicki, Z.A. (1966), “Some applications of the branch
        and bound algorithm to the machine scheduling problem”, Operational
        Research Quarterly, Vol. 17, pp.173-182.
    [2] Bestwick, P.F. and Hastings, N.A.J. (1976), “A new bound for machine
        scheduling”, Operational Research Quarterly, Vol. 27, pp.479-490.
    [3] Cormen, T.H., Leiserson, C.E. and Rivest, R.L. (1990), “Introduction to
        Algorithms”, Cambridge, MA: MIT Press.
    [4] Chandramouli, A.B.(2005), “Heuristic approach for N job 3 machine flow
        shop scheduling problem involving transportation time, break-down time and
        weights of jobs”, Mathematical and Computational Application, Vol.10
        (No.2), pp 301-305.
    [5] Chander Shekharan, K, Rajendra, Deepak Chanderi (1992), “An efficient
        heuristic approach to the scheduling of jobs in a flow shop”, European Journal
        of Operation Research 61, 318-325.
    [6] Dannenbring, D.G. (1977) ,“An evaluation of flowshop sequencing
        heuristics”, Management Science, Vol. 23, No. 11, pp.1174-1182.
    [7] Heydari (2003), “On flow shop scheduling problem with processing of jobs in
        a string of disjoint job blocks: fixed order jobs and arbitrary order jobs”,
        JISSOR , Vol. XXIV , pp 1- 4.
    [8] Ignall, E. and Schrage, L. (1965), “Application of the branch-and-bound
        technique to some flowshop scheduling problems”, Operations Research, Vol.
        13, pp.400-412.
    [9] Johnson S. M. (1954), “Optimal two and three stage production schedule with
        set up times included”. Nay Res Log Quart Vol 1, pp 61-68
    [10] Koulamas, C. (1998), “A new constructive heuristic for the flowshop
       scheduling problem”, European Journal of Operations Research’, Vol. 105,
       pp.66-71.
    [11] Lomnicki, Z.A. (1965), “A branch-and-bound algorithm for the exact
    solution of the three-machine scheduling problem”, Operational Research
    Quarterly, Vol. 16, pp.89-100.
    [12] Maggu & Das (1981), “On n x 2 sequencing problem with transportation
       time of jobs”, Pure and Applied Mathematika Sciences, 12-16.
    [13] Nawaz M., Enscore Jr., E.E. and Ham, I. (1983) , “A heuristic algorithm for
    the m-machine n-job flowshop sequencing problem”, OMEGA International
    Journal of Management Science, Vol. 11, pp.91-95.
    [14] Palmer, D.S.(1965), “Sequencing jobs through a multi-stage process in the
       minimum total time - a quick method of obtaining a near-optimum”,
       Operational Research Quarterly, Vol. 16,No. 1, pp.101-107.



                                              28
Journal of Information Engineering and Applications                         www.iiste.org
ISSN 2224-5782 (print) ISSN 2225-0506 (online)
Vol 2, No.1, 2012

    [15] Park, Y.B. (1981), “A simulation study and an analysis for evaluation of
       performance-effectiveness of flowshop sequencing heuristics: a static and
       dynamic flowshop model”, Master’s Thesis, Pennsylvania State University.
    [16] Singh, T.P., K, Rajindra & Gupta Deepak (2005), “Optimal three stage
       production schedule the processing time and set up times associated with
       probabilities including job block criteria”, Proceeding of National Conference
       FACM- (2005), pp 463-470.
    [17] Sarin, S. and Lefoka, M. (1993), “Scheduling heuristics for the n-job, m-
       machine flowshop”, OMEGA, Vol. 21, pp.229-234.
    [18] Turner S. and Booth D. (1987), “Comparison of heuristics for flowshop
       sequencing”, OMEGA,Vol.15, pp.75-78.
    [19] Temiz Izzettin and Serpil Erol(2004), “Fuzzy branch and bound algorithm
       for flow shop scheduling”, Journal of Intelligent Manufacturing, Vol.15,
       pp.449-454.
    [20] Yoshida and Hitomi (1979), “Optimal two stage production scheduling with
       set up times separated”,AIIETransactions. Vol. II.pp 261-263.




                                              29

Mais conteúdo relacionado

Mais procurados

Performance of metaheuristic methods for loop
Performance of metaheuristic methods for loopPerformance of metaheuristic methods for loop
Performance of metaheuristic methods for loopIAEME Publication
 
IRJET - To Study Analysis and Design of Multi-Storey Building using STAAD-Pro...
IRJET - To Study Analysis and Design of Multi-Storey Building using STAAD-Pro...IRJET - To Study Analysis and Design of Multi-Storey Building using STAAD-Pro...
IRJET - To Study Analysis and Design of Multi-Storey Building using STAAD-Pro...IRJET Journal
 
11.bicriteria in constrained n x 0003www.iiste.org call for paper flow shop t...
11.bicriteria in constrained n x 0003www.iiste.org call for paper flow shop t...11.bicriteria in constrained n x 0003www.iiste.org call for paper flow shop t...
11.bicriteria in constrained n x 0003www.iiste.org call for paper flow shop t...Alexander Decker
 
Bicriteria in constrained n x 3 flow shop to minimize the rental cost, setup ...
Bicriteria in constrained n x 3 flow shop to minimize the rental cost, setup ...Bicriteria in constrained n x 3 flow shop to minimize the rental cost, setup ...
Bicriteria in constrained n x 3 flow shop to minimize the rental cost, setup ...Alexander Decker
 
Breaking a Stick to form a Nonagon with Positive Integers using Programming L...
Breaking a Stick to form a Nonagon with Positive Integers using Programming L...Breaking a Stick to form a Nonagon with Positive Integers using Programming L...
Breaking a Stick to form a Nonagon with Positive Integers using Programming L...IRJET Journal
 
Production & Operation Management Chapter33[1]
Production & Operation Management Chapter33[1]Production & Operation Management Chapter33[1]
Production & Operation Management Chapter33[1]Hariharan Ponnusamy
 
Pi gate-2018-p (gate2016.info)
Pi gate-2018-p (gate2016.info)Pi gate-2018-p (gate2016.info)
Pi gate-2018-p (gate2016.info)DrRojaAbrahamRaju
 
11.machines constrained flow shop scheduling processing time, setup time each...
11.machines constrained flow shop scheduling processing time, setup time each...11.machines constrained flow shop scheduling processing time, setup time each...
11.machines constrained flow shop scheduling processing time, setup time each...Alexander Decker
 
Machines constrained flow shop scheduling processing time, setup time each as...
Machines constrained flow shop scheduling processing time, setup time each as...Machines constrained flow shop scheduling processing time, setup time each as...
Machines constrained flow shop scheduling processing time, setup time each as...Alexander Decker
 
An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplica...
An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplica...An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplica...
An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplica...theijes
 
11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling incl...
11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling incl...11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling incl...
11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling incl...Alexander Decker
 
1.[1 12]bicriteria in nx2 flow shop scheduling including job block
1.[1 12]bicriteria in nx2 flow shop scheduling including job block1.[1 12]bicriteria in nx2 flow shop scheduling including job block
1.[1 12]bicriteria in nx2 flow shop scheduling including job blockAlexander Decker
 

Mais procurados (17)

Performance of metaheuristic methods for loop
Performance of metaheuristic methods for loopPerformance of metaheuristic methods for loop
Performance of metaheuristic methods for loop
 
IRJET - To Study Analysis and Design of Multi-Storey Building using STAAD-Pro...
IRJET - To Study Analysis and Design of Multi-Storey Building using STAAD-Pro...IRJET - To Study Analysis and Design of Multi-Storey Building using STAAD-Pro...
IRJET - To Study Analysis and Design of Multi-Storey Building using STAAD-Pro...
 
N046018089
N046018089N046018089
N046018089
 
11.bicriteria in constrained n x 0003www.iiste.org call for paper flow shop t...
11.bicriteria in constrained n x 0003www.iiste.org call for paper flow shop t...11.bicriteria in constrained n x 0003www.iiste.org call for paper flow shop t...
11.bicriteria in constrained n x 0003www.iiste.org call for paper flow shop t...
 
Bicriteria in constrained n x 3 flow shop to minimize the rental cost, setup ...
Bicriteria in constrained n x 3 flow shop to minimize the rental cost, setup ...Bicriteria in constrained n x 3 flow shop to minimize the rental cost, setup ...
Bicriteria in constrained n x 3 flow shop to minimize the rental cost, setup ...
 
Breaking a Stick to form a Nonagon with Positive Integers using Programming L...
Breaking a Stick to form a Nonagon with Positive Integers using Programming L...Breaking a Stick to form a Nonagon with Positive Integers using Programming L...
Breaking a Stick to form a Nonagon with Positive Integers using Programming L...
 
Production & Operation Management Chapter33[1]
Production & Operation Management Chapter33[1]Production & Operation Management Chapter33[1]
Production & Operation Management Chapter33[1]
 
Be
BeBe
Be
 
Pi gate-2018-p (gate2016.info)
Pi gate-2018-p (gate2016.info)Pi gate-2018-p (gate2016.info)
Pi gate-2018-p (gate2016.info)
 
11.machines constrained flow shop scheduling processing time, setup time each...
11.machines constrained flow shop scheduling processing time, setup time each...11.machines constrained flow shop scheduling processing time, setup time each...
11.machines constrained flow shop scheduling processing time, setup time each...
 
Machines constrained flow shop scheduling processing time, setup time each as...
Machines constrained flow shop scheduling processing time, setup time each as...Machines constrained flow shop scheduling processing time, setup time each as...
Machines constrained flow shop scheduling processing time, setup time each as...
 
G02402054057
G02402054057G02402054057
G02402054057
 
An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplica...
An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplica...An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplica...
An Efficient Elliptic Curve Cryptography Arithmetic Using Nikhilam Multiplica...
 
Topic 1.1
Topic 1.1Topic 1.1
Topic 1.1
 
11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling incl...
11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling incl...11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling incl...
11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling incl...
 
1.[1 12]bicriteria in nx2 flow shop scheduling including job block
1.[1 12]bicriteria in nx2 flow shop scheduling including job block1.[1 12]bicriteria in nx2 flow shop scheduling including job block
1.[1 12]bicriteria in nx2 flow shop scheduling including job block
 
Topic 4.2
Topic 4.2Topic 4.2
Topic 4.2
 

Semelhante a Branch and bound technique for three stage flow shop scheduling problem including breakdown interval and transportation time

Application of branch and bound technique for 3 stage flow shop scheduling pr...
Application of branch and bound technique for 3 stage flow shop scheduling pr...Application of branch and bound technique for 3 stage flow shop scheduling pr...
Application of branch and bound technique for 3 stage flow shop scheduling pr...Alexander Decker
 
11.minimizing rental cost under specified rental policy in two stage flowshop...
11.minimizing rental cost under specified rental policy in two stage flowshop...11.minimizing rental cost under specified rental policy in two stage flowshop...
11.minimizing rental cost under specified rental policy in two stage flowshop...Alexander Decker
 
Minimizing rental cost under specified rental policy in two stage flowshop se...
Minimizing rental cost under specified rental policy in two stage flowshop se...Minimizing rental cost under specified rental policy in two stage flowshop se...
Minimizing rental cost under specified rental policy in two stage flowshop se...Alexander Decker
 
11.flow shop scheduling problem, processing time associated with probabilitie...
11.flow shop scheduling problem, processing time associated with probabilitie...11.flow shop scheduling problem, processing time associated with probabilitie...
11.flow shop scheduling problem, processing time associated with probabilitie...Alexander Decker
 
Flow shop scheduling problem, processing time associated with probabilities i...
Flow shop scheduling problem, processing time associated with probabilities i...Flow shop scheduling problem, processing time associated with probabilities i...
Flow shop scheduling problem, processing time associated with probabilities i...Alexander Decker
 
Bicriteria in n x 2 flow shop scheduling problem under specified rental polic...
Bicriteria in n x 2 flow shop scheduling problem under specified rental polic...Bicriteria in n x 2 flow shop scheduling problem under specified rental polic...
Bicriteria in n x 2 flow shop scheduling problem under specified rental polic...Alexander Decker
 
11.bicriteria in n x 0002www.iiste.org call for paper flow shop scheduling pr...
11.bicriteria in n x 0002www.iiste.org call for paper flow shop scheduling pr...11.bicriteria in n x 0002www.iiste.org call for paper flow shop scheduling pr...
11.bicriteria in n x 0002www.iiste.org call for paper flow shop scheduling pr...Alexander Decker
 
14 sameer sharma final_paper
14 sameer sharma final_paper14 sameer sharma final_paper
14 sameer sharma final_paperAlexander Decker
 
11.minimizing rental cost for n jobs, 0002www.iiste.org call for-paper-machin...
11.minimizing rental cost for n jobs, 0002www.iiste.org call for-paper-machin...11.minimizing rental cost for n jobs, 0002www.iiste.org call for-paper-machin...
11.minimizing rental cost for n jobs, 0002www.iiste.org call for-paper-machin...Alexander Decker
 
Minimizing rental cost for n jobs, 2-machines flow shop scheduling, processin...
Minimizing rental cost for n jobs, 2-machines flow shop scheduling, processin...Minimizing rental cost for n jobs, 2-machines flow shop scheduling, processin...
Minimizing rental cost for n jobs, 2-machines flow shop scheduling, processin...Alexander Decker
 
1.[1 12]bicriteria in nx2 flow shop scheduling including job block
1.[1 12]bicriteria in nx2 flow shop scheduling including job block1.[1 12]bicriteria in nx2 flow shop scheduling including job block
1.[1 12]bicriteria in nx2 flow shop scheduling including job blockAlexander Decker
 
operations management question 6.docx
operations management question 6.docxoperations management question 6.docx
operations management question 6.docxwrite22
 
operations management question 5.docx
operations management question 5.docxoperations management question 5.docx
operations management question 5.docxwrite22
 
On linkage of a flow shop scheduling model including job block criteria with ...
On linkage of a flow shop scheduling model including job block criteria with ...On linkage of a flow shop scheduling model including job block criteria with ...
On linkage of a flow shop scheduling model including job block criteria with ...Alexander Decker
 
11.on linkage of a flow shop scheduling model including job block criteria wi...
11.on linkage of a flow shop scheduling model including job block criteria wi...11.on linkage of a flow shop scheduling model including job block criteria wi...
11.on linkage of a flow shop scheduling model including job block criteria wi...Alexander Decker
 
operations management question 4.docx
operations management question 4.docxoperations management question 4.docx
operations management question 4.docxwrite22
 
19 sameer sharma final paper--268-286
19 sameer sharma final paper--268-28619 sameer sharma final paper--268-286
19 sameer sharma final paper--268-286Alexander Decker
 
Heuristic approach for bicriteria in constrained three stage flow shop schedu...
Heuristic approach for bicriteria in constrained three stage flow shop schedu...Heuristic approach for bicriteria in constrained three stage flow shop schedu...
Heuristic approach for bicriteria in constrained three stage flow shop schedu...Alexander Decker
 
Heuristic approach for bicriteria in constrained three stage flow shop schedu...
Heuristic approach for bicriteria in constrained three stage flow shop schedu...Heuristic approach for bicriteria in constrained three stage flow shop schedu...
Heuristic approach for bicriteria in constrained three stage flow shop schedu...Alexander Decker
 
SchedulingPart 1. Question 1. How many of the statements are tru.docx
SchedulingPart 1.  Question 1.  How many of the statements are tru.docxSchedulingPart 1.  Question 1.  How many of the statements are tru.docx
SchedulingPart 1. Question 1. How many of the statements are tru.docxanhlodge
 

Semelhante a Branch and bound technique for three stage flow shop scheduling problem including breakdown interval and transportation time (20)

Application of branch and bound technique for 3 stage flow shop scheduling pr...
Application of branch and bound technique for 3 stage flow shop scheduling pr...Application of branch and bound technique for 3 stage flow shop scheduling pr...
Application of branch and bound technique for 3 stage flow shop scheduling pr...
 
11.minimizing rental cost under specified rental policy in two stage flowshop...
11.minimizing rental cost under specified rental policy in two stage flowshop...11.minimizing rental cost under specified rental policy in two stage flowshop...
11.minimizing rental cost under specified rental policy in two stage flowshop...
 
Minimizing rental cost under specified rental policy in two stage flowshop se...
Minimizing rental cost under specified rental policy in two stage flowshop se...Minimizing rental cost under specified rental policy in two stage flowshop se...
Minimizing rental cost under specified rental policy in two stage flowshop se...
 
11.flow shop scheduling problem, processing time associated with probabilitie...
11.flow shop scheduling problem, processing time associated with probabilitie...11.flow shop scheduling problem, processing time associated with probabilitie...
11.flow shop scheduling problem, processing time associated with probabilitie...
 
Flow shop scheduling problem, processing time associated with probabilities i...
Flow shop scheduling problem, processing time associated with probabilities i...Flow shop scheduling problem, processing time associated with probabilities i...
Flow shop scheduling problem, processing time associated with probabilities i...
 
Bicriteria in n x 2 flow shop scheduling problem under specified rental polic...
Bicriteria in n x 2 flow shop scheduling problem under specified rental polic...Bicriteria in n x 2 flow shop scheduling problem under specified rental polic...
Bicriteria in n x 2 flow shop scheduling problem under specified rental polic...
 
11.bicriteria in n x 0002www.iiste.org call for paper flow shop scheduling pr...
11.bicriteria in n x 0002www.iiste.org call for paper flow shop scheduling pr...11.bicriteria in n x 0002www.iiste.org call for paper flow shop scheduling pr...
11.bicriteria in n x 0002www.iiste.org call for paper flow shop scheduling pr...
 
14 sameer sharma final_paper
14 sameer sharma final_paper14 sameer sharma final_paper
14 sameer sharma final_paper
 
11.minimizing rental cost for n jobs, 0002www.iiste.org call for-paper-machin...
11.minimizing rental cost for n jobs, 0002www.iiste.org call for-paper-machin...11.minimizing rental cost for n jobs, 0002www.iiste.org call for-paper-machin...
11.minimizing rental cost for n jobs, 0002www.iiste.org call for-paper-machin...
 
Minimizing rental cost for n jobs, 2-machines flow shop scheduling, processin...
Minimizing rental cost for n jobs, 2-machines flow shop scheduling, processin...Minimizing rental cost for n jobs, 2-machines flow shop scheduling, processin...
Minimizing rental cost for n jobs, 2-machines flow shop scheduling, processin...
 
1.[1 12]bicriteria in nx2 flow shop scheduling including job block
1.[1 12]bicriteria in nx2 flow shop scheduling including job block1.[1 12]bicriteria in nx2 flow shop scheduling including job block
1.[1 12]bicriteria in nx2 flow shop scheduling including job block
 
operations management question 6.docx
operations management question 6.docxoperations management question 6.docx
operations management question 6.docx
 
operations management question 5.docx
operations management question 5.docxoperations management question 5.docx
operations management question 5.docx
 
On linkage of a flow shop scheduling model including job block criteria with ...
On linkage of a flow shop scheduling model including job block criteria with ...On linkage of a flow shop scheduling model including job block criteria with ...
On linkage of a flow shop scheduling model including job block criteria with ...
 
11.on linkage of a flow shop scheduling model including job block criteria wi...
11.on linkage of a flow shop scheduling model including job block criteria wi...11.on linkage of a flow shop scheduling model including job block criteria wi...
11.on linkage of a flow shop scheduling model including job block criteria wi...
 
operations management question 4.docx
operations management question 4.docxoperations management question 4.docx
operations management question 4.docx
 
19 sameer sharma final paper--268-286
19 sameer sharma final paper--268-28619 sameer sharma final paper--268-286
19 sameer sharma final paper--268-286
 
Heuristic approach for bicriteria in constrained three stage flow shop schedu...
Heuristic approach for bicriteria in constrained three stage flow shop schedu...Heuristic approach for bicriteria in constrained three stage flow shop schedu...
Heuristic approach for bicriteria in constrained three stage flow shop schedu...
 
Heuristic approach for bicriteria in constrained three stage flow shop schedu...
Heuristic approach for bicriteria in constrained three stage flow shop schedu...Heuristic approach for bicriteria in constrained three stage flow shop schedu...
Heuristic approach for bicriteria in constrained three stage flow shop schedu...
 
SchedulingPart 1. Question 1. How many of the statements are tru.docx
SchedulingPart 1.  Question 1.  How many of the statements are tru.docxSchedulingPart 1.  Question 1.  How many of the statements are tru.docx
SchedulingPart 1. Question 1. How many of the statements are tru.docx
 

Mais de Alexander Decker

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Alexander Decker
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inAlexander Decker
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesAlexander Decker
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksAlexander Decker
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dAlexander Decker
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceAlexander Decker
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifhamAlexander Decker
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaAlexander Decker
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenAlexander Decker
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksAlexander Decker
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget forAlexander Decker
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabAlexander Decker
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...Alexander Decker
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalAlexander Decker
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesAlexander Decker
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbAlexander Decker
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloudAlexander Decker
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveragedAlexander Decker
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenyaAlexander Decker
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health ofAlexander Decker
 

Mais de Alexander Decker (20)

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale in
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websites
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banks
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized d
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistance
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifham
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibia
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school children
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banks
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget for
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjab
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incremental
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniques
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo db
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloud
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveraged
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenya
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health of
 

Último

The Kubernetes Gateway API and its role in Cloud Native API Management
The Kubernetes Gateway API and its role in Cloud Native API ManagementThe Kubernetes Gateway API and its role in Cloud Native API Management
The Kubernetes Gateway API and its role in Cloud Native API ManagementNuwan Dias
 
Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintMahmoud Rabie
 
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"DianaGray10
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesMd Hossain Ali
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioChristian Posta
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationIES VE
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...Aggregage
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAshyamraj55
 
100+ ChatGPT Prompts for SEO Optimization
100+ ChatGPT Prompts for SEO Optimization100+ ChatGPT Prompts for SEO Optimization
100+ ChatGPT Prompts for SEO Optimizationarrow10202532yuvraj
 
Governance in SharePoint Premium:What's in the box?
Governance in SharePoint Premium:What's in the box?Governance in SharePoint Premium:What's in the box?
Governance in SharePoint Premium:What's in the box?Juan Carlos Gonzalez
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7DianaGray10
 
9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding TeamAdam Moalla
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024D Cloud Solutions
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfJamie (Taka) Wang
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaborationbruanjhuli
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfDianaGray10
 
VoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXVoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXTarek Kalaji
 

Último (20)

The Kubernetes Gateway API and its role in Cloud Native API Management
The Kubernetes Gateway API and its role in Cloud Native API ManagementThe Kubernetes Gateway API and its role in Cloud Native API Management
The Kubernetes Gateway API and its role in Cloud Native API Management
 
Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership Blueprint
 
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
UiPath Clipboard AI: "A TIME Magazine Best Invention of 2023 Unveiled"
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and Istio
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
 
20230104 - machine vision
20230104 - machine vision20230104 - machine vision
20230104 - machine vision
 
100+ ChatGPT Prompts for SEO Optimization
100+ ChatGPT Prompts for SEO Optimization100+ ChatGPT Prompts for SEO Optimization
100+ ChatGPT Prompts for SEO Optimization
 
Governance in SharePoint Premium:What's in the box?
Governance in SharePoint Premium:What's in the box?Governance in SharePoint Premium:What's in the box?
Governance in SharePoint Premium:What's in the box?
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7
 
9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
 
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdfUiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
UiPath Solutions Management Preview - Northern CA Chapter - March 22.pdf
 
VoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBXVoIP Service and Marketing using Odoo and Asterisk PBX
VoIP Service and Marketing using Odoo and Asterisk PBX
 

Branch and bound technique for three stage flow shop scheduling problem including breakdown interval and transportation time

  • 1. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5782 (print) ISSN 2225-0506 (online) Vol 2, No.1, 2012 Branch and Bound Technique for three stage Flow Shop Scheduling Problem Including Breakdown Interval and Transportation Time Deepak Gupta* Department of Mathematics Maharishi Markandeshwar University Mullana, Ambala (India) * E-mail of the corresponding author: guptadeepak2003@yahoo.co.in Abstract This paper deals with minimization of the total elapsed time for nx3 flow shop scheduling problem in which the effect of breakdown interval and the transportation time are considered. A Branch and Bound technique is given to optimize the objective of minimize the total elapsed time. The algorithm is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule. A numerical illustration is given to clarify the algorithm. Keywords: Flow shop scheduling, Processing time, Transportation time, Branch and Bound Technique, Optimal sequence. 1. Introduction: Scheduling problems are common occurrence in our daily life e.g. ordering of jobs for processing in a manufacturing plant, programs to be run in a sequence at a computer center etc. Such problems exist whenever there is an alternative choice in which a number of jobs can be done. Now-a-days, the decision makers for the manufacturing plant have interest to find a way to successfully manage resources in order to produce products in the most efficient way. They need to design a production schedule to minimize the flow time of a product. The number of possible schedules in a flow shop scheduling problem involving n-jobs and m-machines is ( n !)m . The optimal solution for the problem is to find the optimal or near optimal sequence of jobs on each machine in order to minimize the total elapsed time.Johnson (1954) first of all gave a method to minimise the makespan for n-job, two-machine scheduling problems. The scheduling problem practically depends upon the important factors namely, Transportation time, break down effect, Relative importance of a job over another job etc. These concepts were separately studied by Ignall and Scharge (1965), Maggu and Dass (1981), Temiz and Erol(2004),Yoshida and Hitomi (1979), Lomnicki (1965), Palmer (1965) , Bestwick and Hastings (1976), Nawaz et al. (1983) , Sarin and Lefoka (1993) , Koulamas (1998) , Dannenbring (1977) , etc. Singh T.P. and Gupta Deepak (2005)studied the optimal two stage production schedule in which processing time and set up time both were associated with probabilities including job block criteria. Heydari (2003)dealt with a flow shop scheduling problem where n jobs are processed in two disjoint job blocks in a string consists of one job block in which order of jobs is fixed and other job block in which order of jobs is arbitrary. Lomnicki (1965) introduced the concept of flow shop scheduling with the help of branch and bound method. Further the work was developed by Ignall and Scharge (1965), Chandrasekharan (1992), Brown and Lomnicki(1966) , with the branch and bound technique to the machine scheduling problem by introducing different parameters. The concept of transportation time is very important in scheduling when the machines are distantly situated. The break down of the machines have significant role in the production concern. The effect of break down interval is important as there are feasible situations where machine during process may get sudden 24
  • 2. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5782 (print) ISSN 2225-0506 (online) Vol 2, No.1, 2012 break down due to either failure of any component of machine or the machines are supposed to stop their working for a certain interval of time due to some external imposed policy such as electric cut/shortage due to government policy. The working of machine no longer remains continuous and is subject to break-down for a certain interval of time. This paper extends the study made by Ignall and Scharge (1965) by introducing the concept of transportation time and break down interval. Hence the problem discussed here is wider and has significant use of theoretical results in process industries. 2 Practical Situation Many applied and experimental situations exist in our day-to-day working in factories and industrial production concerns etc. In many manufacturing companies different jobs are processed on various machines. These jobs are required to process in a machine shop A, B, C, ---- in a specified order. When the machines on which jobs are to be processed are planted at different places, the transportation time (which includes loading time, moving time and unloading time etc.) has a significant role in production concern. The break down of the machines (due to delay in material, changes in release and tails date, tool unavailability, failure of electric current, the shift pattern of the facility, fluctuation in processing times, some technical interruption etc.) have significant role in the production concern. 3 Notations: We are given n jobs to be processed on three stage flowshop scheduling problem and we have used the following notations: Ai : Processing time for job i on machine A Bi : Processing time for job i on machine B Ci : Processing time for job i on machine C Cij : Completion time for job i on machines A, B and C ti : Transportation time of ith job from machine A to machine B. gi : Transportation time of ith job from machine B to machine C. Sk : Sequence using johnson’s algorithm L : Length of break down interval. Jr : Partial schedule of r scheduled jobs Jr′ : The set of remaining (n-r) free jobs 4 Mathematical Development: Consider n jobs say i=1, 2, 3 … n are processed on three machines A, B & C in the order ABC. A job i (i=1,2,3…n) has processing time Ai , Bi & Ci on each machine respectively, assuming their respective probabilities pi , qi & ri such that 0 ≤ pi ≤ 1, Σpi = 1, 0 ≤ qi ≤ 1, Σqi = 1, 0≤ ri ≤ 1, Σri = 1. Let ti and gi be the transportation time of machine A to machine B and machine B to machine C respectively. The mathematical model of the problem in matrix form can be stated as : 25
  • 3. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5782 (print) ISSN 2225-0506 (online) Vol 2, No.1, 2012 Jobs Machine A Machine B Machine C ti gi i Ai Bi Ci 1 A1 t1 B1 g1 C1 2 A2 t2 B2 g2 C2 3 A3 t3 B3 g3 C3 4 A4 t4 B4 g4 C4 - ---- --- --- --- ---- - -- -- -- --- -- n An tn Bn gn Cn Tableau – 1 Our objective is to obtain the optimal schedule of all jobs which minimize the total elapsed time whenever the effect of break down interval (a, b) is given, using branch and bound technique. 5 Algorithm: Step1: Calculate (i) g1 = t ( J r ,1) + ∑ Ai + min( Bi + Ci ) ′ i∈J r ′ i∈J r (ii) g2 = t ( J r , 2) + ∑ Bi + min(Ci ) ′ i∈J r ′ i∈ jr (iii) g3= t ( J r ,3) + ∑ Ci ′ i∈ jr Step 2: Calculate g = max [g1, g2, g3] We evaluate g first for the n classes of permutations, i.e. for these starting with 1, 2, 3………n respectively, having labelled the appropriate vertices of the scheduling tree by these values. Step 3: Now explore the vertex with lowest label. Evaluate g for the (n-1) subclasses starting with this vertex and again concentrate on the lowest label vertex. Continuing this way, until we reach at the end of the tree represented by two single permutations, for which we evaluate the total work duration. Thus we get the optimal schedule of the jobs. Step 4: Prepare in-out table for the optimal sequence obtained in step 4 and read the effect of break down interval (a, b) on different jobs. Step 5: Form a modified problem with processing times p′ , p′ & p′ on machines A, i1 i2 i3 B & C respectively. If the break down interval (a, b) has effect on job i then p′ =pi1 + L i1 , p′ = pi2 + L and p′ = pi3 + L i2 i3 where L = b – a, the length of the break down interval. If the break down interval (a, b) has no effect on job i then p′ =pi1 , p′ = pi2 and p′ = pi3. i1 i2 i3 26
  • 4. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5782 (print) ISSN 2225-0506 (online) Vol 2, No.1, 2012 Step 6: Repeat the procedure to get the optimal sequence for the modified scheduling problem using step1 to step 3. Compute the in-out table and get the minimum total elapsed time. 6 Numerical Example: Consider 5 jobs 3 machine flow shop problem. processing time of the jobs on each machine is given. Our objective is to obtain the optimal schedule of all jobs which minimize the total elapsed time whenever the effect of break down interval (25, 35) is given. Jobs Machine A Machine B Machine C I Ai ti Bi gi Ci 1 15 4 20 5 16 2 25 7 10 8 5 3 10 6 12 3 12 4 18 9 15 7 18 5 16 2 25 6 3 Tableau – 2 Solution:Step1: Calculate (i) g1 = t ( J r ,1) + ∑ Ai + min( Bi + Ci ) ′ i∈J r ′ i∈J r (ii) g2 = t ( J r , 2) + ∑ Bi + min(Ci ) ′ i∈J r ′ i∈ jr (iii) g3= t ( J r ,3) + ∑ Ci ′ i∈ jr For J1 = (1).Then J′(1) = {2,3,4}, we get g1 = 43 , g2 = 37 & g3 = 43 g = max(g1, g2, g3) = 43 similarly, we have LB(2)= 51 , LB(3)= 52 and LB(4)= 58 Step 2 & 3: Now branch from J1 = (1). Take J2 =(12). Then J′2={3,4} and LB(12) = 51 Proceeding in this way, we obtain lower bound values on the completion time on machine C as shown in the tableau- 3 Step 4 :Therefore the sequence S1 is 1-3-4-2 and the corresponding in-out table and checking the effect of break down interval (25, 35) on sequence S1 is as in tableau4: Step 5: The modified problem after the effect of break down interval (25,35) with processing times A′i, B′i and C′i on machines A, B & C respectively is as in tableau-5: Step 6: Now, on repeating the procedure to get the optimal sequence for the modified scheduling problem using step 1 to step 3, we obtain lower bound values on the 27
  • 5. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5782 (print) ISSN 2225-0506 (online) Vol 2, No.1, 2012 completion time on machine C as shown in the tableau- 6 we have get the sequence S2 : 3-1-4-5-2. Compute the in-out table for S2 and get the minimum total elapsed time as in tableau-7. Hence the total elapsed time is 131 units. References : [1] Brown, A.P.G. and Lomnicki, Z.A. (1966), “Some applications of the branch and bound algorithm to the machine scheduling problem”, Operational Research Quarterly, Vol. 17, pp.173-182. [2] Bestwick, P.F. and Hastings, N.A.J. (1976), “A new bound for machine scheduling”, Operational Research Quarterly, Vol. 27, pp.479-490. [3] Cormen, T.H., Leiserson, C.E. and Rivest, R.L. (1990), “Introduction to Algorithms”, Cambridge, MA: MIT Press. [4] Chandramouli, A.B.(2005), “Heuristic approach for N job 3 machine flow shop scheduling problem involving transportation time, break-down time and weights of jobs”, Mathematical and Computational Application, Vol.10 (No.2), pp 301-305. [5] Chander Shekharan, K, Rajendra, Deepak Chanderi (1992), “An efficient heuristic approach to the scheduling of jobs in a flow shop”, European Journal of Operation Research 61, 318-325. [6] Dannenbring, D.G. (1977) ,“An evaluation of flowshop sequencing heuristics”, Management Science, Vol. 23, No. 11, pp.1174-1182. [7] Heydari (2003), “On flow shop scheduling problem with processing of jobs in a string of disjoint job blocks: fixed order jobs and arbitrary order jobs”, JISSOR , Vol. XXIV , pp 1- 4. [8] Ignall, E. and Schrage, L. (1965), “Application of the branch-and-bound technique to some flowshop scheduling problems”, Operations Research, Vol. 13, pp.400-412. [9] Johnson S. M. (1954), “Optimal two and three stage production schedule with set up times included”. Nay Res Log Quart Vol 1, pp 61-68 [10] Koulamas, C. (1998), “A new constructive heuristic for the flowshop scheduling problem”, European Journal of Operations Research’, Vol. 105, pp.66-71. [11] Lomnicki, Z.A. (1965), “A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem”, Operational Research Quarterly, Vol. 16, pp.89-100. [12] Maggu & Das (1981), “On n x 2 sequencing problem with transportation time of jobs”, Pure and Applied Mathematika Sciences, 12-16. [13] Nawaz M., Enscore Jr., E.E. and Ham, I. (1983) , “A heuristic algorithm for the m-machine n-job flowshop sequencing problem”, OMEGA International Journal of Management Science, Vol. 11, pp.91-95. [14] Palmer, D.S.(1965), “Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining a near-optimum”, Operational Research Quarterly, Vol. 16,No. 1, pp.101-107. 28
  • 6. Journal of Information Engineering and Applications www.iiste.org ISSN 2224-5782 (print) ISSN 2225-0506 (online) Vol 2, No.1, 2012 [15] Park, Y.B. (1981), “A simulation study and an analysis for evaluation of performance-effectiveness of flowshop sequencing heuristics: a static and dynamic flowshop model”, Master’s Thesis, Pennsylvania State University. [16] Singh, T.P., K, Rajindra & Gupta Deepak (2005), “Optimal three stage production schedule the processing time and set up times associated with probabilities including job block criteria”, Proceeding of National Conference FACM- (2005), pp 463-470. [17] Sarin, S. and Lefoka, M. (1993), “Scheduling heuristics for the n-job, m- machine flowshop”, OMEGA, Vol. 21, pp.229-234. [18] Turner S. and Booth D. (1987), “Comparison of heuristics for flowshop sequencing”, OMEGA,Vol.15, pp.75-78. [19] Temiz Izzettin and Serpil Erol(2004), “Fuzzy branch and bound algorithm for flow shop scheduling”, Journal of Intelligent Manufacturing, Vol.15, pp.449-454. [20] Yoshida and Hitomi (1979), “Optimal two stage production scheduling with set up times separated”,AIIETransactions. Vol. II.pp 261-263. 29