Learning-Based Algorithm Selection for a Multiprocessor Scheduling Problem
摘要
This paper addresses a multiprocessor scheduling problem with real-world-inspired constraints. A learning-based prediction approach is proposed to support an effective algorithm selection during problem-solving. Classifiers are trained to predict whether a particular solver should be employed. The core of the contribution is the selection and engineering of features based on the structural properties of problem instances. These features are used as predictors in several well-known binary classification approaches. Computational experiments based on randomly generated problem instances reveal accuracy scores of up to 90% and indicate the potential time savings when embedding the proposed classifiers into the overall solution procedure.