Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
charts & higher possibility of false alarm (2) For a 3-sigma chart,
1. Process Analysis definitions: (1) capacity of resource: 한 resource probability of false alarm is less than 0.3% (3) 2-sigma chart has 0.5%
당 이론적으로 도달할 수 있는 생산성 (written in units per time) (2) capacity of 16. Process Capability Index: CL 들이 항상 SL 안에 들어와야함
process: 어떤 process 가 이론적으로 도달할 수 있는 생산성 = min (cor 1, cor2,
Min {0.889,1.333}: this
cor3, …) (3) flow rate / throughput rate: 프로세스의 실제 생산성; actual suggests that the UCL
exceeded USL
productivity = min (capacity of process, input rate) (4) flow time /
throughput time: 평균적으로 상품 한개가 프로세스를 통과하는데 총 걸리는 시 How to improve from 2-
간 = combination of each resource’s process time = inventory * arrival rate sigma to 3-sigma: (1)
change the specification
(5) cycle time: time between consecutive units leaving the process; how limits with your customer
long it takes to process each unit = 1 / flow rate (6) takt time: 수요를 맞추 (2) reduce sigma of the
process
기 위해 유지해야하는 최소한의 생산성 = available work hours / customer
demand (6) utilization = cycle time / takt time (7) number of workers At least 99.73% within specification limits
17. Service
needed = flow time / takt time (8) bottleneck: unit with the lowest capacity Operation: (1)
or longest process time; 2. Little’s Law: (1) Average throughput time = capacity of service
inventory / arrival rate (units per time) = inventory / flow rate; (2) days of cannot be stored or
inventory (period of time an inventory stays in the system until it is sold) = carried over (2)
inventory / costs of goods sold ($/year); (3) inventory turnover (number of what is the root cause of waiting: variation (3) variation of arrival:
times an inventory replenishes in a year) = costs of goods sold / inventory; Peak (rush) and non-peak time, advance booking, fast pass, price
3. Inventory buildup diagram: discount for off-peak hours (4) variation of service times: express check-
out line, toll tags, etc. 18. Queuing Model: (1) exponential arrival time
= l (customers/hour); (2) exponential service time: service rate at each
server = µ (customers/hour) (3) number of servers = s; (4) server
utilization = l / µ (*mind the units)
Input – capacity