🧪 Optimization Resource Optimization Simulation

This simulator tackles the multiprocessor scheduling problem: a pool of jobs, each carrying its own resource cost, must be spread across a set of machines so no single machine becomes a bottleneck. A live simulated-annealing optimizer proposes one job move at a time, accepting improving moves always and worsening moves probabilistically based on a cooling temperature, and the 3D scene renders each machine as a tower of stacked job blocks that visibly settle toward an even, balanced height as the schedule converges. Live readouts track the makespan, the load standard deviation across machines, the annealer's temperature and its iteration count, and adjustable sliders let you resize the workload, the machine pool, and the cooling rate to see how each changes the optimizer's behaviour.