REVISION LECTURE
Dr. Waleed Elfeel
CH 5
CAPACITY PLANNING
Capacity Analysis (Bottleneck)
PROBLEM 1 : The three-station work cell at Pullman Mfg., Inc. is illustrated in Figure
S7.8. It has two machines at station 1 in parallel (i.e., the product needs to go
through only one of the two machines before proceeding to station 2).
a) What is the throughput time of this work cell?
b) What is the bottleneck time of this work cell?
c) What is the bottleneck station?
d) If the firm operates 8 hours per day, 6 days per week, what is the weekly
capacity of this work cell?
Capacity Analysis (Bottleneck)
PROBLEM 2: A Company assembles two parts for its product , parts
1 and 2. Part 1 is first processed at workstation A for 15 minutes per
unit and then processed at workstation B for 10 minutes per unit.
Part 2 is simultaneously processed at workstation C for 20 minutes
per unit. Workstations B and C feed the parts to an assembler at
workstation D, where the two parts are assembled. The assembly
time at workstation D is 15 minutes.
Ch 5s
DECISION THEORY
DECISION THEORY
PROBLEM 1: A company seeks to make a decision on capacity
for next year. Estimated payoffs under each of the two possible
states of nature are as shown in the table below.
Which alternative should be selected if the decision criterion is:
a. Maximax? b. Maximin? c. Laplace?
d. Minimax regret?
DECISION THEORY
PROBLEM 2: Refer to Problem 1. Suppose after a certain
amount of discussion, the company is able to
subjectively assess the probabilities of low and high
demand: P (low) =0.3 and P (high) = 0.7.
A. Determine the expected profit of each alternative.
B. What is the alternative the company would select
under the Expected Value decision criteria?
C. Compute the Expected Profit Under Certainty,
Expected Profit Under Risk, and the Expected Value of
Perfect Information?
DECISION THEORY
PROBLEM 3: The operations manager for a well-drilling company
must recommend whether to build a new facility, expand his
existing one, or do nothing. He estimates that long-run profits (in
$000) will vary with the amount of precipitation (rainfall) as
follows:
DECISION THEORY
A - Which alternative should be selected if the decision criterion
under different uncertainty criteria?
B - If he feels the chances of low, normal, and high precipitation
are 30%, 20%, and 50% respectively, what are expected long-run
profits for the alternative he will select?
C - What is the expected value of perfect information (EVPI)?
Ch. 11
AGGREGATE PLANNING
AGGREGATE PLANNING
PROBLEM 1: Prepare a master production schedule for the
following situation. The forecast for each period is 70 units. The
starting inventory is zero. The production lot size is 100 units. The
following table shows committed orders.
AGGREGATE PLANNING
PROBLEM 2: The forecast and customer orders are as shown in
the table below. The beginning inventory level is 70 and the
production lot size is 100 units. Determine Available-to-promise
inventory under the condition that schedule production when
the projected on-hand inventory would be negative without
production
AGGREGATE PLANNING
PROBLEM 3: Wormwood, Ltd., produces a variety of furniture
products. The planning committee wants to prepare an
aggregate plan for the next six months using the following
information:
Subcontracting can handle a maximum of 10 units per month.
Beginning inventory is zero. Develop a plan that minimizes total
cost. No back orders are allowed.
AGGREGATE PLANNING
PROBLEM 4: Bike Components Inc. of Wheel ville, Illinois,
manufactures bicycle wheels in two different sizes. the firm’s
manager, has just received Big Bike’s order for the next six months.
Currently the company employs 28 full-time, highly skilled
employees, each of whom can produce 50 wheels per month.
Because skilled labor is in short supply, the manager would like to
develop one pure level-output plan.
AGGREGATE PLANNING
There is no inventory of finished wheels on hand at present, but
he would like to have 300 on hand at the end of April. Big Bike
will tolerate back orders of up to 200 units per month. Show your
level plan in tabular form. Overtime is not allowed except for the
last month. Calculate the total annual cost of your plan using
these costs:
Ch. 6
PROCESS SELECTION
AND FACILITY LAYOUT
LINE BALANCE
PROBLEM 1: The tasks shown in the following precedence
diagram are to be assigned to workstations with the intent of
minimizing idle time. Management has designed an output rate
of 275 units per day. Assume 440 minutes are available per day.
a. Determine the appropriate cycle time.
b. What is the minimum number of stations possible?
c. Assign tasks using the “positional weight” rule: Assign tasks
with highest following times (including a task’s own time) first.
Break ties using greatest number of following tasks.
d. Compute efficiency.
LINE BALANCE
PROBLEM 2: The tasks shown in the following precedence
diagram are to be assigned to workstations with the
intent of minimizing idle time. Management has
designed an output rate of 40 units per day. Assume 600
minutes are available per day.
a. Determine the appropriate cycle time.
b. What is the minimum number of stations possible?
c. Assign tasks based on the largest number of following
tasks first. Break ties using the order of the longest task
time.
d. Compute efficiency.
LINE BALANCE
PROBLEM 3: For the set of tasks given below, do the
following:
LINE BALANCE
A. Develop the precedence diagram.
B. Determine the minimum number of workstations for
output of 500 units per day.
C. Balance the line using the largest positional weight
heuristic. Break ties with the most following tasks heuristic.
Use a cycle time of 50 seconds.
D. Rebalance the assembly line. This time, use the
longest operation time heuristic. Break ties with the most
following tasks heuristic.
e. Calculate the percentage idle time for the line in
each case.
Ch. 16
SCHEDULING
SCHEDULING
PROBLEM 1: First Printing wants to find the minimum total cost assignment
of 3 jobs to 3 typesetters.
SCHEDULING
PROBLEM 2: . The following table contains information on the cost to run
three jobs on four available machines. Determine an assignment plan
that will minimize costs
SCHEDULING
PROBLEM 3: . Determine the optimum assignment of jobs to workers for
the following data
SCHEDULING
PROBLEM 4 : Given the information below, determine the sequence of jobs
, the average flow time , average lateness, and average number of work
center for each of these rules: (A) FCFS (B) SPT (C) EDD
Job Processing Time Hour Due
(Hrs)
A 17 15
B 10 25
C 5 20
D 7 32
E 11 38
SCHEDULING
PROBLEM 5 : Job times (including processing and setup) are shown in the
following table for five jobs waiting to be processed at a work center:
1- Determine the processing sequence that would result from each of these
priority rules: A. SPT B. EDD
2- Determine each of the following performance measures for first-come, first-
served processing order: A- Makespan. B- Average flow time.
C- Average tardiness. D- Average number of jobs at the workstation
