Scribd
Upload
66 views12 pages

FacilitiesPlanning Lecture4

Here are the steps to solve this in-class activity on machine assignment problem: a) Construct a multiple activity chart showing the activities and times. b) The transient time is the time before the repeating cycle starts. c) To determine the cycle length, add the longest operation time (machine processing at 12 min) to the concurrent activities time (loading and unloading at 1 min each = 2 min). So the cycle length is 12 + 2 = 14 minutes. d) To determine machine idle time, subtract the cycle time (14 min) from the machine processing time (12 min). So machine idle time is 14 - 12 = 2 minutes. e) Operator idle time is 0 since they are

Uploaded by

Yasser Mohamed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
66 views12 pages

FacilitiesPlanning Lecture4

Here are the steps to solve this in-class activity on machine assignment problem: a) Construct a multiple activity chart showing the activities and times. b) The transient time is the time before the repeating cycle starts. c) To determine the cycle length, add the longest operation time (machine processing at 12 min) to the concurrent activities time (loading and unloading at 1 min each = 2 min). So the cycle length is 12 + 2 = 14 minutes. d) To determine machine idle time, subtract the cycle time (14 min) from the machine processing time (12 min). So machine idle time is 14 - 12 = 2 minutes. e) Operator idle time is 0 since they are

Uploaded by

Yasser Mohamed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Facilities Planning

ENIE 453
September 19, 2022

Dr. Fahrettin Eldemir


Agenda
• Machine Assignment Problem
Machine Assignment Problem
• Multiple identical machines
• Typical Operations
• Loading Machines, Machine Processing,
Unloading, Inspecting, Travelling
between machines
• Involvements
• Machine Involved
• Operator involved
• or Both involved
Multiple Activity Chart
• 3 machine and 1 operator
• Loading: 1 min
• Machine automated operating time: 6 min
• Traveling time: 0.5 min
• Unloading: 1 min
• Inspecting and Packing: 0.5 min
Multiple Activity Chart
• 3 machine and 1 operator
• Loading: 1 min
• Machine automated operating time: 6 min
• Traveling time: 0.5 min
• Unloading: 1 min
• Inspecting and Packing: 0.5 min
Number of machines to assign
• a : concurrent activity time
• b : independent operator activity time
• t : independent machine activity time

• n' : ideal number of identical machines to assign an operator


Number of machines to assign
• a : concurrent activity time
• b : independent operator activity time
• t : independent machine activity time
• n' : ideal number of identical machines to assign an operator
• m : actual number of machines assigned

• Tc : Repeating cycle time

t
Number of machines to assign
• a : concurrent activity time
• b : independent operator activity time
• t : independent machine activity time

• n' : ideal number of identical machines to assign an operator


• m : actual number of machines assigned

• Tc : Repeating cycle time


• Im : Idle time for each machine during a repeating cycle
• IO : Idle operator time during a repeating cycle
Cost Per Unit Produced
• TC(m) :
• Co : Cost of operator per hour
• Cm : Cost of machine per hour
Cost Per Unit Produced
In Class Activity
a) Construct a multiple activity chart.
• 2 machine and 1 operator b) What is the transient time?
c) Determine the cycle length (cycle time).
• Loading: 1 min d) Determine machine idle time during a
• Machine automated operating repeating cycle
time: 12 min e) Determine operator idle time during a
repeating cycle
• Traveling time: 1 min f) Determine ideal machine assignment
• Unloading: 1 min g) Calculate if you assign nearest integer number
of machines that is greater than ideal
• Inspecting and Packing: 1 min h) Calculate if you assign nearest integer number
• Operator Cost $20/hour of machines that is less than ideal
• Machine Cost $10/hour i) Compare costs and what would be your
recommendation

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy