MultiProcessor Scheduling is PLS-Complete


We consider two natural models of local improvement. We show that the MULTIPROCESSOR SCHEDULING problem, i.e., the problem of scheduling weighted jobs on identical machines with the objective to minimize the makespan, is PLS-complete for a sufficiently large neighborhood. In the first model, in an improvement step, either the makespan decreases or the… (More)
DOI: 10.1109/HICSS.2009.832


Cite this paper

@article{Dumrauf2009MultiProcessorSI, title={MultiProcessor Scheduling is PLS-Complete}, author={Dominic Dumrauf and Burkhard Monien and Karsten Tiemann}, journal={2009 42nd Hawaii International Conference on System Sciences}, year={2009}, pages={1-10} }