0000000565-apparel industry case study

Upload: gm6860

Post on 04-Jun-2018

216 views

Category:

Documents


0 download

TRANSCRIPT

  • 8/13/2019 0000000565-Apparel Industry Case Study

    1/10

    Apparel

    Industry Case

    Study By:-Ankit Mozika 211018

    Apoorva Agarwal 211030

  • 8/13/2019 0000000565-Apparel Industry Case Study

    2/10

    The Case

    Large amount of wastage in cutting operation

    The process involved putting several layers of cloth of

    standard width on a table and putting stencils, i.e. thetemplates in order to cut the cloth.

    To reduce the wastage the decision was to be made by R&D

    department.

  • 8/13/2019 0000000565-Apparel Industry Case Study

    3/10

    Case Background

    Zodiac manufactures different types of shirts

    in different sizes.

  • 8/13/2019 0000000565-Apparel Industry Case Study

    4/10

    Objective Function

    Minimize the setup cost.Minimize the number of rotation

    Upper bound on the number of layer is 35.

  • 8/13/2019 0000000565-Apparel Industry Case Study

    5/10

    Decision Variable

    X1= Number of rotations required to fulfill the

    demand of 54 shirts for size 38

    X2= Number of rotations required to fulfill the

    demand of 84 shirts for size 40 X3= Number of rotations required to fulfill the

    demand of 91 shirts for size 42

    X4= Number of rotations required to fulfill the

    demand of 60 shirts for size 44 X5= Number of rotations required to fulfill the

    demand of 29 shirts for size 46

  • 8/13/2019 0000000565-Apparel Industry Case Study

    6/10

    Objective Function

    Min Z =X1+X2+X3+X4+X5

    Subject to constraints

    X1>=2X2>=3

    X3>=3

    X4>=2

    X5>=1

    X1, X2, X3, X4, X5 >= 0 and all are integers

  • 8/13/2019 0000000565-Apparel Industry Case Study

    7/10

    Adding Surplus Variable

    Objective Function

    Min Z=X1+X2+X3+X4+X5+0S1+0S2+0S3+0S4+0S5

    Subject to constraints

    X1+S1=2

    X2+S2=3

    X3+S3=3

    X4+S4=2

    X5+S5=1

    Xi, Si >= 0 and all are integers

    Where iis 1 to 5

  • 8/13/2019 0000000565-Apparel Industry Case Study

    8/10

    Cj 1 1 1 1 1 0 0 0 0 0

    BV

    X1 X2 X3 X4 X5 S1 S2 S3 S4 S5 Sol.

    X1 1 1 0 0 0 0 -1 0 0 0 0 2

    X2 1 0 1 0 0 0 0 -1 0 0 0 3

    X3 1 0 0 1 0 0 0 0 -1 0 0 3

    X4 1 0 0 0 1 0 0 0 0 -1 0 2

    X5 1 0 0 0 0 1 0 0 0 0 -1 1

    Cj-Zj 0 0 0 0 0 1 1 1 1 1

  • 8/13/2019 0000000565-Apparel Industry Case Study

    9/10

    Optimal Solution

    X1=2

    X2=3

    X3=3X4=2

    X5=1

    Min Z = 2+3+3+2+1 = 11

  • 8/13/2019 0000000565-Apparel Industry Case Study

    10/10