"Do you generate a separate sequence for each orebody simulation?" I hear this very often. And the short answer is: ๐—ก๐—ผ. ๐—ก๐—ผ. ๐—”๐—ป๐—ฑ ๐—ฎ๐—ฏ๐˜€๐—ผ๐—น๐˜‚๐˜๐—ฒ๐—น๐˜† ๐—ป๐—ผ. Think about it: If you had a different extraction sequence for every simulation, which one would you follow? Which one would the medium and short-term planners inherit? Which one would operations execute in practice? It would be ๐—ฐ๐—ต๐—ฎ๐—ผ๐˜€. Planning needs clear and actionable guidance, not 100 sequencing versions. Let me break it down simply: When you're solving a LoM plan optimization problem using block-based scheduling approach, there are three major decisions to be made: โ€ข ๐—˜๐˜…๐˜๐—ฟ๐—ฎ๐—ฐ๐˜๐—ถ๐—ผ๐—ป ๐˜€๐—ฒ๐—พ๐˜‚๐—ฒ๐—ป๐—ฐ๐—ฒ (which blocks to mine and when) โ€ข ๐—–๐˜‚๐˜-๐—ผ๐—ณ๐—ณ/๐—ฑ๐—ฒ๐˜€๐˜๐—ถ๐—ป๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ฝ๐—ผ๐—น๐—ถ๐—ฐ๐˜† (where the material goes: mill, stockpile, leach pad, waste, etc.) โ€ข ๐—ฃ๐—ฟ๐—ผ๐—ฐ๐—ฒ๐˜€๐˜€๐—ถ๐—ป๐—ด ๐˜€๐˜๐—ฟ๐—ฒ๐—ฎ๐—บ ๐—ฑ๐—ฒ๐—ฐ๐—ถ๐˜€๐—ถ๐—ผ๐—ป๐˜€ (material flow after the block's first destination is determined) Now, hereโ€™s the important part: The extraction sequence is whatโ€™s called a ๐—ณ๐—ถ๐—ฟ๐˜€๐˜-๐˜€๐˜๐—ฎ๐—ด๐—ฒ decision (in two-stage stochastic optimization terminology). Which means: It must be defined ๐—ฟ๐—ถ๐—ด๐—ต๐˜ ๐—ป๐—ผ๐˜„ before any additional information is revealed. It is also called a ๐˜€๐—ฐ๐—ฒ๐—ป๐—ฎ๐—ฟ๐—ถ๐—ผ-๐—ถ๐—ป๐—ฑ๐—ฒ๐—ฝ๐—ฒ๐—ป๐—ฑ๐—ฒ๐—ป๐˜ decision. You need a sequence that planning teams can actually work with. "First-stage" decisions are commitments you make before knowing exactly what Mother Nature has prepared for you. They're the backbone of the mine plan. โœ… So what sequence does stochastic mine planning actually give you? โ€ข A ๐˜€๐—ถ๐—ป๐—ด๐—น๐—ฒ ๐—ผ๐—ฝ๐˜๐—ถ๐—บ๐—ถ๐˜‡๐—ฒ๐—ฑ ๐—ฒ๐˜…๐˜๐—ฟ๐—ฎ๐—ฐ๐˜๐—ถ๐—ผ๐—ป ๐˜€๐—ฒ๐—พ๐˜‚๐—ฒ๐—ป๐—ฐ๐—ฒ. โ€ข Built by looking at all orebody simulations ๐˜€๐—ถ๐—บ๐˜‚๐—น๐˜๐—ฎ๐—ป๐—ฒ๐—ผ๐˜‚๐˜€๐—น๐˜†. โ€ข Designed to ๐—บ๐—ฎ๐˜…๐—ถ๐—บ๐—ถ๐˜‡๐—ฒ ๐—ก๐—ฃ๐—ฉ while trying to minimize deviations from targets across uncertainties. In other words: You don't optimize for one future. ๐—ฌ๐—ผ๐˜‚ ๐—ผ๐—ฝ๐˜๐—ถ๐—บ๐—ถ๐˜‡๐—ฒ ๐—ฎ๐—ฐ๐—ฟ๐—ผ๐˜€๐˜€ ๐—บ๐—ฎ๐—ป๐˜† ๐—ณ๐˜‚๐˜๐˜‚๐—ฟ๐—ฒ๐˜€, and find the path that, on average, gives you the best, and ๐—บ๐—ผ๐˜€๐˜ ๐—ฟ๐—ถ๐˜€๐—ธ-๐—ฟ๐—ฒ๐˜€๐—ถ๐—น๐—ถ๐—ฒ๐—ป๐˜ ๐—ผ๐˜‚๐˜๐—ฐ๐—ผ๐—บ๐—ฒ. Thatโ€™s why the extraction sequence is scenario-independent. Thatโ€™s why stochastic planning works in the real world and major mining companies are starting to integrate it into their planning workflow. So next time someone asks: "Do you generate a sequence for every simulation?" you can just smile and say: "๐—ก๐—ผ, ๐˜„๐—ฒ ๐—ด๐—ฒ๐—ป๐—ฒ๐—ฟ๐—ฎ๐˜๐—ฒ ๐—ผ๐—ป๐—ฒ ๐˜€๐—ฒ๐—พ๐˜‚๐—ฒ๐—ป๐—ฐ๐—ฒ ๐˜๐—ต๐—ฎ๐˜'๐˜€ ๐˜€๐—บ๐—ฎ๐—ฟ๐˜ ๐—ฒ๐—ป๐—ผ๐˜‚๐—ด๐—ต ๐˜๐—ผ ๐˜€๐˜‚๐—ฟ๐˜ƒ๐—ถ๐˜ƒ๐—ฒ ๐˜๐—ต๐—ฒ๐—บ ๐—ฎ๐—น๐—น." ๐˜๐˜ฏ ๐˜ง๐˜ถ๐˜ต๐˜ถ๐˜ณ๐˜ฆ ๐˜ฑ๐˜ฐ๐˜ด๐˜ต๐˜ด, ๐˜ ๐˜ธ๐˜ช๐˜ญ๐˜ญ ๐˜ต๐˜ข๐˜ญ๐˜ฌ ๐˜ข๐˜ฃ๐˜ฐ๐˜ถ๐˜ต ๐˜ต๐˜ฉ๐˜ฆ ๐˜ฐ๐˜ต๐˜ฉ๐˜ฆ๐˜ณ ๐˜ฅ๐˜ฆ๐˜ค๐˜ช๐˜ด๐˜ช๐˜ฐ๐˜ฏ ๐˜ต๐˜บ๐˜ฑ๐˜ฆ๐˜ด ๐˜ข๐˜ฏ๐˜ฅ ๐˜ฉ๐˜ฐ๐˜ธ ๐˜ธ๐˜ฆ ๐˜จ๐˜ฆ๐˜ต ๐˜ฑ๐˜ณ๐˜ฐ๐˜ฃ๐˜ข๐˜ฃ๐˜ช๐˜ญ๐˜ช๐˜ด๐˜ต๐˜ช๐˜ค ๐˜ง๐˜ฐ๐˜ณ๐˜ฆ๐˜ค๐˜ข๐˜ด๐˜ต๐˜ด ๐˜ฐ๐˜ถ๐˜ต ๐˜ฐ๐˜ง ๐˜ข ๐˜ด๐˜ช๐˜ฏ๐˜จ๐˜ญ๐˜ฆ ๐˜ณ๐˜ช๐˜ด๐˜ฌโ€“๐˜ณ๐˜ฆ๐˜ด๐˜ช๐˜ญ๐˜ช๐˜ฆ๐˜ฏ๐˜ต ๐˜ด๐˜ฆ๐˜ฒ๐˜ถ๐˜ฆ๐˜ฏ๐˜ค๐˜ฆ. ๐˜š๐˜ต๐˜ข๐˜บ ๐˜ต๐˜ถ๐˜ฏ๐˜ฆ๐˜ฅ!