Preview

TEXTILE MILL SCHEDULING case

Good Essays
Open Document
Open Document
516 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
TEXTILE MILL SCHEDULING case
Vi Le
MGM350C
Professor Rohit RampalCase: Textile Mill Scheduling
Let X3R = yards of fabric 3 on regular looms X4R = yards of fabric 4 on regular looms X5R = yards of fabric 5 on regular looms X1D = yards of fabric 1 on dobbie looms X2D = yards of fabric 2 on dobbie looms X3D = yards of fabric 3 on dobbie looms X4D = yards of fabric 4 on dobbie looms X5D = yards of fabric 5 on dobbie looms Y1 = yards of fabric 1 purchased Y2 = yards of fabric 2 purchased Y3 = yards of fabric 3 purchased Y4 = yards of fabric 4 purchased Y5 = yards of fabric 5 purchased
Profit Contribution per Yard:
Fabric = Manufactured (Variable cost –Selling Price)
Purchased = (Selling Price – Purchase Price)
Fabric Manufactured Purchased
1 0.99-0.66=0.33 0.99-0.80=0.19
2 0.86-0.55=0.31 0.86-0.70=0.16
3 1.10-0.49=0.61 1.10-0.60=0.50
4 1.24-0.51=0.73 1.24-0.70=0.54
5 0.70-.50=0.20 0.70-.70=0
Production Times in Hours per Yard:
Fabric Regular Dobbie1 1 / 4.63 = 0.21598
2 1 / 4.63 = 0.21598
3 1 / 5.23 = 0.1912 1 / 5.23 = 0.1912
4 1 / 5.23 = 0.1912 1 / 5.23 = 0.1912
5 1 / 4.17 = 0.2398 1 / 4.17 = 0.2398
Max Profit objective function
Max 0.61 X3R + 0.73X4R + 0.20X5R + 0.33X1D + 0.31X2D + 0.61X3D + 0.73X4D + 0.20X5D + 0.19Y1 + 0.16Y2 + 0.50Y3 + 0.54Y4
Dobbie Hours Available: 8 Looms x 30 days x 24 hours/day = 5760
Regular Hours Available: 30 Looms x 30 days x 24 hours/day = 21600
Loom Constraints:
Constraint 1: Regular Looms: 0.192X3R + 0.1912X4R + 0.2398X5R ≤ 21600
Constraint 2: Dobbie Looms: 0.21598X1D + 0.21598X2D + 0.1912X3D + 0.1912X4D + 0.2398X5D ≤ 5760
Demand Constraints:
Constraint 3: X1D + Y2 = 16500
Constraint 4: X2D + Y2 = 22000
Constraint 5: X3R + X3D + Y3 = 62000
Constraint 6: X4R + X4D + Y4 = 7500
Constraint 7: X5R + X5D + Y5 = 62000
According to the
Production/ purchased schedule (yards)
Fabric Regular DobbieLooms Looms Purchased
1 4469 11831
2 22000 3 2771

You May Also Find These Documents Helpful

  • Good Essays

    Food Booth Case Study

    • 1116 Words
    • 5 Pages

    Space constraint: 196 X1 + 16 X2 + 25 X3 ≤ 55296 -------- (1st Constraint)…

    • 1116 Words
    • 5 Pages
    Good Essays
  • Satisfactory Essays

    The Triangle workers went on strike seeking better wages and hours, improved working conditions and union representation. The owners of the Triangle Shirtwaist Factory, Max Blanck and Isaac Harris, negotiated with strikers an increase in wages and working conditions, but refused to allow unions to organize in their factory. The factory workers agreed to go back to work without union representation. How would these factory workers have benefited from being part of the union? Would this has improved the safety conditions of the factory or was more government involvement necessary?…

    • 90 Words
    • 1 Page
    Satisfactory Essays
  • Good Essays

    Mat 540 Stateline shipping

    • 1018 Words
    • 5 Pages

    Here the demand constraint + + ++ + ≤ 65 represents the number of barrels transported to the waste disposal site Whitewater from all the six plants. The barrel of wastes that can accommodate in the waste disposal site Whitewater is limited to 65 barrels. The demand constraints are ≤ inequalities because the total demand (65+80+105) = 250 exceeds the total supply (26+42+53+29+38) = 223.…

    • 1018 Words
    • 5 Pages
    Good Essays
  • Good Essays

    In the United States Army Food Program there are specific ways to fill out and prepare documents according to AR 30-22, The Army Food Program. These procedures are outlined in the Department of the Army Pamphlet (DA PAM) 30-22, Operating Procedures for the Army Food Program. This paper will advise the proper way to document the required items on a Production Schedule as well as completing a Risk Management Data Log – Cooking and Serving as summarized from DA PAM 30-22.…

    • 1022 Words
    • 5 Pages
    Good Essays
  • Good Essays

    Complete the Solver setup by adding the INTEGER constraint for the variables and run. HINT: You can only use integer (whole people) so look at the options in the Solver constraint. Print a picture of the Solver setup (not options) here.…

    • 2233 Words
    • 9 Pages
    Good Essays
  • Satisfactory Essays

    0.36 0.64 0.00 0.18 0.82 0.00 0.18 0.82 0.50 0.45 0.55 0.00 0.27 0.73 0.67 0.36 0.64 0.50 0.45 0.55 0.40 0.55 0.45 0.33…

    • 2005 Words
    • 58 Pages
    Satisfactory Essays
  • Satisfactory Essays

    x1 ≥ x2 + x3 (changed to –x1 + x2 + x3 ≤ 0 for constraint)…

    • 413 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Finance Study Guide

    • 487 Words
    • 2 Pages

    26,000/(1+.16)^1 + 26,000/(1+.16)^2 + 26,000/(1+.16)^3 + 26,000/(1+.16)^4 - 42,000/(1.16)^1 + 3000/(1+.16)^2 + 3000/(1+.16)^3 + 3000/(1+.16)^4…

    • 487 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Question 1 Graphical solution (16 marks) For a linear programming model given below: Decision variables x1  Units of product 1 to produce. x2 – Units of product 2 to produce. Objective function Maximize 4.0x1 + 3.6x2 Constraints Constraint 1: 11x1 + 5x2 > 55 Constraint 2: 3x1 + 4x2 < 36 Constraint 3: 4x1 – 9x2 < 0 Nonnegativity: x1, x2 >= 0 Solve this linear programming model by using the graphical approach (Graph paper is provided on the next page). For your graphical solution,  Label the axes.  Draw and label each constraint. Show your procedure of drawing Constraint 3 only.  For each constraint line, determine and label which side is feasible. Briefly explain how to determine the feasible side for Constraint 3 only.  Shade and label the feasible region.  Identify all feasible corner points and determine the coordinates of each feasible corner point. Show only your calculations for the corner point determined by Constraints 1 and 2.  Determine the optimal solution and objective function value.  For all calculations in this question, please…

    • 2847 Words
    • 12 Pages
    Good Essays
  • Satisfactory Essays

    Linear Programming

    • 431 Words
    • 4 Pages

    The Southern Textile Mill produces 5 different fabrics. Each fabric can be woven on one or…

    • 431 Words
    • 4 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Macro Ii Problem Set 3

    • 3310 Words
    • 14 Pages

    Subbing this into our already modified budget constraint yields c1 [1 + β] c1 [2 + β] = w 1 − c1 + = w1 + w 2 n2 1+r…

    • 3310 Words
    • 14 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Ch 4 Test Bank Simplex

    • 1908 Words
    • 25 Pages

    Let x1, x2 and x3 be the nonbasic variables, so x1 = x2 = x3 = 0. Solving for x4, x5 and x6 from the equations in the constraints:…

    • 1908 Words
    • 25 Pages
    Satisfactory Essays
  • Good Essays

    So it means Yards of fabric 1 on dobbie loom is 4666.67; Yards of fabric 2 on dobbie loom is 22000; Yards of fabric 3 on dobbie loom is 0; Yards of fabric 4 on dobbie loom is 0; Yards of fabric 5 on dobbie loom is 0; Yards of fabric 3 on…

    • 477 Words
    • 2 Pages
    Good Essays
  • Good Essays

    It is the traditional method of manufacture in which an operator makes right through one garment at a time. The advantages and disadvantages of a make through system are shown in Table 1. The advantages of the Make Through The disadvantages of the Make Through System System are: are: 1. Quick throughput time. 2. Easy to supervise. 1. Low productivity. 2. High labour cost. 3. Only very experienced operators can be used. 4. It is a system only suitable in couture and sample making. Table 1 - Advantages and disadvantages of Make Through System.…

    • 2285 Words
    • 10 Pages
    Good Essays
  • Good Essays

    is the bonafide record of training done by T.SARANYA Reg. No: 098001612043 of MBA during the year 2009-2010.…

    • 10078 Words
    • 41 Pages
    Good Essays