{"component":{"type":17,"accent_color":10980315,"components":[{"type":10,"content":"-# WikiRNG · Roll of 11/5/2026 · by [CraneGenesis4k](https://wikirng.com/u/CraneGenesis4k)"},{"type":10,"content":"## [Fernandez's bound](https://wikirng.com/roll/2AW0DS)"},{"type":10,"content":">>> In computer science and operations research, Fernandez’s bound (FB) is a lower-bounding technique used in exact algorithms for multiprocessor scheduling problems, particularly within branch-and-bound frameworks. It provides tighter lower bounds than some…"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟪 Remarkable · 230,172 SP\n-# Top 5.7%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟪 🤓 **Too Technical** · Remarkable · +210,372 SP\n-# Tagged as too technical.\n🟩 🧯 **Multiple Issues** · Notable · +5,495 SP\n-# Has the multiple issues box.\n🟩 ✍️ **Apostrophe** · Notable · +3,117 SP\n-# Title has an apostrophe.\n🟩 📖 **Further Reading** · Notable · +2,500 SP\n-# Has a Further reading section.\n🟩 🥲 **Lonely** · Notable · +1,370 SP\n-# Only one article links here.\n🟩 📎 **More Citations Needed** · Notable · +1,331 SP\n-# Tagged as needing more sources.\n-# +10 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/2AW0DS"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Fernandez's_bound"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}