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.
Ler o casoIdeias engenhosas que resolveram problemas difíceis. Veja por que funcionaram.
O arquivo completo, no appQuando não há tradução, os cartões levam ao original publicado e mantêm seu idioma.
A Japanese toolmaker that repeatedly failed with Lean turned to Theory of Constraints, syncing the whole plant to its one bottleneck.
Ler o casoECN sets a bit rather than dropping a packet, so the sender slows down without paying for a costly retransmission.
Ler o casoBackblaze splits a file into 17 shards plus 3 parity, so any 17 of 20 rebuild it - durability at about 18% overhead, not 200%.
Ler o casoA portable liquid-nitrogen unit chills produce at harvest in ~1 hour instead of the ~8 hours a mechanical fridge takes.
Ler o casoAn OASIS-standard publish/subscribe messaging transport with small headers and three QoS levels, built for small devices on flaky links.
Ler o casoMatter is an open, IP-based application layer all the major platforms agreed to, so a certified device works across ecosystems.
Ler o casoCIDR replaced rigid Class A/B/C blocks with variable-length prefixes, allowing exact sizing and route aggregation.
Ler o casoThe SBA does not lend; it guarantees a share of a private bank loan, letting banks underwrite and the taxpayer share the risk.
Ler o casoAn insurer and a marketplace replaced their delivery bags with reflective ones, making pedestrians visible at night and reversing the insurer's losses.
Ler o casoAn empty shop on Auckland's K Road turned receipts from any nearby business into spendable money, becoming the world's first neighbourhood loyalty programme.
Ler o casoUruguay'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.
Ler o casoBroder's 1997 MinHash sketch estimated the Jaccard similarity of huge pages via a few minimum hashes, so AltaVista clustered near-duplicates cheaply.
Ler o casoRalph 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.
Ler o casoMaymounkov 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.
Ler o casoBurrows and Wheeler's 1994 transform sorted a block's rotations into an order that clusters equal characters, letting bzip2 beat older compressors.
Ler o casoAgrawal and Srikant's 1994 Apriori algorithm found frequent item-sets in huge transaction logs by using a subset rule to prune candidates early.
Ler o casoUniqlo cut out wholesalers, designed its own clothes and linked stores to HQ online, so it sold quality basics cheaply.
Ler o casoIn 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.
Ler o casoIn 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.
Ler o casoRather 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.
Ler o caso