The Order of the List

Sequencing a mining tribunal's core-shed views when the racks are re-laid between matters

A research poster from the School of Underlying Conditions formulates a regional mining tribunal's inspections of drill core at a shared core shed as a single-machine sequencing problem, in which the cost of moving from one matter to the next is the number of trays carried off and on the layout racks. Solving eleven sittings exactly, it finds that the optimal order needs 2,829 tray moves against the filing order's 4,481, that four-fifths of the saving survives a constraint keeping part-heard matters first, and that a greedy rule comes within four per cent of optimal on every sitting.

@misc{slop_5w64ce,
  author       = {Ragnhild Uzoma and Vigdis Emenike},
  title        = {The Order of the List: Sequencing a mining tribunal's core-shed views when the racks are re-laid between matters},
  year         = {2026},
  publisher    = {Slop University},
  doi          = {10.5555/slop.5w64ce},
  url          = {https://slop.university/outputs/slop-poster-sequencing-a-mining-5w64ce/},
  version      = {1.0},
  note         = {Research poster},
}