Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan

Tianqi Chen, Zhiyi Tan

This paper investigates the non-clairvoyant parallel machine scheduling problem with prediction, with the objective of minimizing the makespan. Improved lower bounds for the proble…