Hitachi Tool dropped Lean and let one bottleneck set the clock
A Japanese toolmaker that repeatedly failed with Lean turned to Theory of Constraints, syncing the whole plant to its one bottleneck.
사례 읽기어려운 문제를 해결한 기발한 아이디어와 성공 요인을 탐구하세요.
전체 아카이브는 앱에서번역이 없는 사례는 게시된 원문으로 연결되며 원문의 언어로 표시됩니다.
A Japanese toolmaker that repeatedly failed with Lean turned to Theory of Constraints, syncing the whole plant to its one bottleneck.
사례 읽기ECN sets a bit rather than dropping a packet, so the sender slows down without paying for a costly retransmission.
사례 읽기Backblaze splits a file into 17 shards plus 3 parity, so any 17 of 20 rebuild it - durability at about 18% overhead, not 200%.
사례 읽기A portable liquid-nitrogen unit chills produce at harvest in ~1 hour instead of the ~8 hours a mechanical fridge takes.
사례 읽기An OASIS-standard publish/subscribe messaging transport with small headers and three QoS levels, built for small devices on flaky links.
사례 읽기Matter is an open, IP-based application layer all the major platforms agreed to, so a certified device works across ecosystems.
사례 읽기CIDR replaced rigid Class A/B/C blocks with variable-length prefixes, allowing exact sizing and route aggregation.
사례 읽기The SBA does not lend; it guarantees a share of a private bank loan, letting banks underwrite and the taxpayer share the risk.
사례 읽기An insurer and a marketplace replaced their delivery bags with reflective ones, making pedestrians visible at night and reversing the insurer's losses.
사례 읽기An empty shop on Auckland's K Road turned receipts from any nearby business into spendable money, becoming the world's first neighbourhood loyalty programme.
사례 읽기Uruguay's Jupiter bought unused billboard inventory for a tenth of the price and wrapped it in actual aluminium foil, so the medium itself became the product.
사례 읽기Broder's 1997 MinHash sketch estimated the Jaccard similarity of huge pages via a few minimum hashes, so AltaVista clustered near-duplicates cheaply.
사례 읽기Ralph Merkle's 1979 hash tree commits to a whole dataset in one root so any single record is verified with only ~log n hashes, not the file.
사례 읽기Maymounkov and Mazières' 2002 Kademlia treated XOR of node IDs as a distance, so a node finds any peer in O(log n) hops and gossips found nodes.
사례 읽기Burrows and Wheeler's 1994 transform sorted a block's rotations into an order that clusters equal characters, letting bzip2 beat older compressors.
사례 읽기Agrawal and Srikant's 1994 Apriori algorithm found frequent item-sets in huge transaction logs by using a subset rule to prune candidates early.
사례 읽기Uniqlo cut out wholesalers, designed its own clothes and linked stores to HQ online, so it sold quality basics cheaply.
사례 읽기In 1988 Qualcomm put two-way messaging and vehicle position on long-haul trucks, so dispatchers knew where each load was and the fleet finally ran on live data.
사례 읽기In 1964 Orlicky's material requirements planning read a finished-goods plan and exploded it, via the bill of materials, into exactly when to buy each part.
사례 읽기Rather than just-in-time, just-in-sequence delivers parts already sorted in build order, so a worker pulls exactly the part for the car in front of them.
사례 읽기