Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    WeeMow 03

    Uploaded by

    Manvi Bhatt
    The document describes a linear programming problem to minimize the total cost of assigning 14 jobs (A-N) to 3 teams over multiple days. The objective is to minimize the total cost while satisfying constraints: 1) each team works for 10 hours per day or 450 minutes, 2) the daily budget is $1000, and 3) each job is assigned to exactly one team. Binary variables x1-x42 are used to indicate if each job is assigned to each team, with the goal of finding the optimal assignment to minimize total cost.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    WeeMow 03

    Uploaded by

    Manvi Bhatt
    18 views2 pages
    The document describes a linear programming problem to minimize the total cost of assigning 14 jobs (A-N) to 3 teams over multiple days. The objective is to minimize the total cost while satisfying constraints: 1) each team works for 10 hours per day or 450 minutes, 2) the daily budget is $1000, and 3) each job is assigned to exactly one team. Binary variables x1-x42 are used to indicate if each job is assigned to each team, with the goal of finding the optimal assignment to minimize total cost.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a linear programming problem to minimize the total cost of assigning 14 jobs (A-N) to 3 teams over multiple days. The objective is to minimize the total cost while satisfying constraints: 1) each team works for 10 hours per day or 450 minutes, 2) the daily budget is $1000, and 3) each job is assigned to exactly one team. Binary variables x1-x42 are used to indicate if each job is assigned to each team, with the goal of finding the optimal assignment to minimize total cost.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    18 views2 pages

    WeeMow 03

    Uploaded by

    Manvi Bhatt
    The document describes a linear programming problem to minimize the total cost of assigning 14 jobs (A-N) to 3 teams over multiple days. The objective is to minimize the total cost while satisfying constraints: 1) each team works for 10 hours per day or 450 minutes, 2) the daily budget is $1000, and 3) each job is assigned to exactly one team. Binary variables x1-x42 are used to indicate if each job is assigned to each team, with the goal of finding the optimal assignment to minimize total cost.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    CASE 2: TOTAL COST MINIMISATION (Refer to sheet 2)

    Formulation of LPP

    Objective:
    Minimise Total Cost

    Assumptions:

    Job
    Team A B C D E F G H I J K L M N

    1 X1 X2 X3 X4 X5 X6 X7 X8 X9 X10 X11 X12 X13 X14

    2 X15 X16 X17 X18 X19 X20 X21 X22 X23 X24 X25 X26 X27 X28

    3 X29 X30 X31 X32 X33 X34 X35 X36 X37 X38 X39 X40 X41 X42
    x1 , x2 ….x42 denote binary variables, where 1 denotes job being done and 0 denotes job not being done.

    ⇒ Min Z = 448 x1 + 70 x2 +94 x3 +65x4 +80x5 +55x6 +70x7 +72x8 +100x9 +65x10 +55x11 +118x12 +90x13
    +67x14 +55x15 +60x16 +84x17 +65x18 +75 x19 +65x20 +70X21 +74x22 +90x23 +65x24 +57x25 +110x26 +98x27
    +72x28 +50x29 +55x30 +75x31 +60x32 +66x33 +60x34 +67x35 +65x36 +80x37 +62x38 +56x39 +95x40 +75x41
    +68x42

    Subject to,

    ● 45 x1 + 67 x2 +90 x3 +61x4 +75x5 +48x6 +65x7 +67x8 +95x9 +60x10 +47x11 +114x12 +85x13 +63x14
    +65x15 +72x16 +105x17 +78x18 +93 x19 +70x20 +83X21 +84x22 +110x23 +78x24 +64x25 +135x26
    +107x27 +81x28 +78+x29 +85x30 +125x31 +97x32 +107x33 +95x34 +110x35 +100x36 +130x37 +95x38
    +84x39 +135x40 +125x41 +102x42 ≤ 1000

    ● x1 , x2 ….till x42 are integers

    ● 45 x1 + 67 x2 +90 x3 +61x4 +75x5 +48x6 +65x7 +67x8 +95x9 +60x10 +47x11 +114x12 +85x13 +63x14
    ≤ 450

    ● 65x15 +72x16 +105x17 +78x18 +93 x19 +70x20 +83X21 +84x22 +110x23 +78x24 +64x25 +135x26
    +107x27 +81x28 ≤ 450

    ● 78+x29 +85x30 +125x31 +97x32 +107x33 +95x34 +110x35 +100x36 +130x37 +95x38 +84x39 +135x40
    +125x41 +102x42 ≤ 450

    ● x1 + x15 + x29 = 1
    ● x2 + x16 + x30 = 1

    ● x3 + x17 + x31 = 1

    ● x4 + x18 + x32 = 1

    ● x5+ x19 + x33 = 1

    ● x6 + x20 + x34 = 1

    ● x7 + x21 + x35 = 1

    ● x8 + x22 + x36 = 1

    ● x9 + x23 + x37 = 1

    ● x10 + x24 + x38 = 1


    ● x11 + x25 + x39 = 1

    ● x12 + x26 + x40 = 1

    ● x13 + x27 + x41 = 1

    ● x14 + x28 + x42 = 1

    Answer to the Problem Statement:

    1. A. The problem requires us to develop a schedule of work assignment between 3 Teams - Team1,
    Team2 and Team3 in such a manner that it minimizes the overall time taken. Team 1 has five
    members, Team 2 has four members and Team3 has three members.

    B. On a normal summer WeeMow has 14 jobs, denoted by Job A to N. Each team works for 10
    hours a day and factoring in inefficiencies, only 45 minutes in an hour are actually productive.
    Resulting in the daily working time for a team being 450 minutes
    45 mins (per hour) * 10 hours = 450 minutes

    C. There also exists a daily budget of $1,000 that has to be split between the 3 teams

    2. A matrix representing the intersection of the teams and jobs is created to house the variables of
    the problem. Each intersection can hold 2 values “1” or “0” with “1” indicating that the
    corresponding team has been allocated the corresponding job and “0” indicating that that job has
    been allocated to someone else.

    You might also like