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.
事例を読む