|
Polynomial-time scheduling on three identical machines
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
LOADING...
0%
thinking... about 3 hours remaining
GAME #124
Polynomial-time scheduling on three identical machines
1 level of pure algorithms, speed!
PLAY
LEAN
VERIFIED
If this game doesn't work on your computer, go here for help. (Lean version available!)expertly designed by an internal OpenAI model
| >>> How to Play <<< |
| Polynomial-time scheduling on three identical machines. Resolves the three-processor unit-job scheduling problem of Garey and Johnson: a deterministic polynomial-time algorithm minimizes makespan for nonpreemptive unit-length jobs with arbitrary precedence constraints on three identical parallel machines. For an explicitly given precedence graph, it decides deadline feasibility exactly and constructs a feasible schedule. |
| >>> Level Select <<< |
|
We give a uniform deterministic polynomial-time algorithm for scheduling unit-length jobs with arbitrary precedence constraints on three identical parallel machines. The algorithm constructs a schedule of minimum makespan and decides exactly whether all jobs can finish by a specified deadline. The proof reorganizes feasible schedules into intervals whose job sets have descriptions of bounded size. A dynamic program searches a family containing polynomially many such descriptions. Global boundary conditions and simplification of inherited information keep the descriptions bounded throughout the decomposition.
|
|