Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    BA 3352: Capacity - Layout Questions

    Uploaded by

    lightknow
    This document discusses several capacity and layout questions. It begins by asking the reader to solve a problem from the textbook about determining the optimal layout based on cost. It then asks the reader to draw the layout of a grocery store and discuss how it could be altered to minimize customer weight carried. Finally, it presents a transportation problem with multiple locations and departments, and asks the reader to compute the total distance traveled for different assignment configurations.

    Copyright:

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

    BA 3352: Capacity - Layout Questions

    Uploaded by

    lightknow
    6 views2 pages
    This document discusses several capacity and layout questions. It begins by asking the reader to solve a problem from the textbook about determining the optimal layout based on cost. It then asks the reader to draw the layout of a grocery store and discuss how it could be altered to minimize customer weight carried. Finally, it presents a transportation problem with multiple locations and departments, and asks the reader to compute the total distance traveled for different assignment configurations.

    Original Description:

    gfgfh

    Original Title

    qch5-6

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses several capacity and layout questions. It begins by asking the reader to solve a problem from the textbook about determining the optimal layout based on cost. It then asks the reader to draw the layout of a grocery store and discuss how it could be altered to minimize customer weight carried. Finally, it presents a transportation problem with multiple locations and departments, and asks the reader to compute the total distance traveled for different assignment configurations.

    Copyright:

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

    BA 3352: Capacity - Layout Questions

    Uploaded by

    lightknow
    This document discusses several capacity and layout questions. It begins by asking the reader to solve a problem from the textbook about determining the optimal layout based on cost. It then asks the reader to draw the layout of a grocery store and discuss how it could be altered to minimize customer weight carried. Finally, it presents a transportation problem with multiple locations and departments, and asks the reader to compute the total distance traveled for different assignment configurations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    BA 3352: Capacity - Layout Questions

    1. Solve Problem 7 on p.192 of the textbook. Hint: Draw a graph where the x-axis is the number of units
    and y-axis is the cost. Draw the cost under each alternative to gure out which alternative is the best when.
    2. This exercise is about a grocery store such as Tom Thumb or Albertson.
    a) Go to a grocery store. Draw the stores layout (not to scale) and clearly indicate the following depart-
    ments: meats (M), fresh produce (FP), dairy (D), soft drinks (SD), cereals (C), can foods (CF), pharmacy
    (P). Write down the stores name and thje address.
    b) Almost all supermarkets arrange their layouts to maximize sales. How would you alter the layout in a)
    to minimize the weight carried by customers in the market? Do not prepare another layout. It suces to
    discuss, possibly via examples, what the new layout will look like and why?
    3. Read Solved Problem 3 on pp.253-255. Now consider a dierent problem with locations A,B,C,D and
    departments 1,2,3,4. Note that the symmetric distances (in meters) among locations (A,B,C,D) are
    From To A B C D
    A 0 40 80 70
    B 0 40 50
    C 0 60
    D 0
    and nonsymmetric number of trips among departments (1,2,3,4) are
    From To 1 2 3 4
    1 0 1 2 3
    2 0 0 4 4
    3 0 0 0 2
    4 5 5 3 0
    Compute the total distance traveled per day for the following location-department assignments: A-1, B-2,
    C-3, D-4 and A-4, B-3, C-2, D-1. In the assignment A-1, B-2, C-3, D-4, department 1 is at location A and
    department 2 is at location B so the distances between the department 1 and 2 is 40 metres, which is the
    distance between locations A and B. In the assignment A-4, B-3, C-2, D-1, department 1 is at location D
    and department 2 is at location C so the distances between the department 1 nad 2 is 60 meters, which is the
    distance between locations C and D. Between A-1, B-2, C-3, D-4 and A-4, B-3, C-2, D-1, which assignment
    is better?
    4. Refer to the precedence graph at the bottom of p.256 of the textbook. The company wants to produce
    240 units every day using eight hour daily shifts.
    a) What is OT and CT?
    b) Assign operations to workstations using the greatest task time rule.
    c) Note the number of worksatations N necessary and compute eciency.
    5. Refering to question 3 above.
    a) Assign operations to workstations using the greatest positional weight rule.
    b) Note the number of worksatations N necessary and compute eciency.
    6. Consider a general assembly line balancing problem. Suppose that we do not change the problem data
    (operation times, precedence structure, cycle time) but use two dierent assignment rules (say postional
    1
    weight and operation time) to obtain two dierent assignments. Is it possible that one assignment has
    larger eciency and larger N than the other? Explain?
    7. The activity relationship chart for a machine shop is shown in the gure below.
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @
    @

    CELL R
    CELL Q
    CELL P
    CELL O
    CELL N
    CELL M
    CELL L
    CELL K
    X
    E
    U
    O
    U
    E
    U
    X
    U
    U
    X
    A
    X
    A
    U
    A
    U
    A
    A
    I
    O
    A
    A
    A
    X
    U
    X
    U
    Arrange the eight departments in a 2 4 grid:
    2

    You might also like