Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers

Abstract

This paper introduces a machine learning-augmented General Variable Neighborhood Search algorithm, termed Self-adaptive General Variable Neighborhood Search (SGVNS), for solving the two-identical parallel machine scheduling problem with unrelated servers. The studied problem is of high practical relevance in various industries and presents a significant gap in the existing literature. The motivation for this study stems from the healthcare industry, specifically surgery scheduling with limited anesthesiologists’ availability. Two mathematical formulations are presented to solve this scheduling problem. However, these formulations are limited to small-scale problems, prompting the need for an efficient metaheuristic. Therefore, a novel variant of the General Variable Neighborhood Search metaheuristic is developed, incorporating a self-adaption mechanism based on an Extreme Learning Machine (ELM) algorithm. Extensive experiments are conducted to assess the performance of the SGVNS metaheuristic on various classes of instances. The results demonstrate the effectiveness and efficiency of SGVNS in solving previously unsolved small-sized instances, outperforming both formulations while maintaining reasonable computation times. © 2023 Elsevier Ltd.

Keywords: Extreme learning machine, General variable neighborhood search, Healthcare services scheduling, Parallel machine scheduling, Unrelated servers