A cooperative coevolutionary hyper-heuristic approach to solve lot-sizing and job shop scheduling problems using genetic programming

• Published in: International journal of production research Vol. 62; no. 16; pp. 5850 - 5877
• Main Authors: Zeiträg, Yannik, Rui Figueira, José, Figueira, Gonçalo
• Format: Journal Article
• Language: English
• Published: London Taylor & Francis 17-08-2024; Taylor & Francis LLC
• Subjects: Complexity; cooperative coevolution; Genetic algorithms; genetic programming; greedy heuristic; Heuristic job shop scheduling; hyper-heuristic; Job shop scheduling; Job shops; Lot sizing
• ISSN: 0020-7543; 1366-588X
• DOI: 10.1080/00207543.2023.2301044

Lot-sizing and scheduling in a job shop environment is a fundamental problem that appears in many industrial settings. The problem is very complex, and solutions are often needed fast. Although many solution methods have been proposed, with increasingly better results, their computational times are not suitable for decision-makers who want solutions instantly. Therefore, we propose a novel greedy heuristic to efficiently generate production plans and schedules of good quality. The main innovation of our approach represents the incorporation of a simulation-based technique, which directly generates schedules while simultaneously determining lot sizes. By utilising priority rules, this unique feature enables us to address the complexity of job shop scheduling environments and ensures the feasibility of the resulting schedules. Using a selection of well-known rules from the literature, experiments on a variety of shop configurations and complexities showed that the proposed heuristic is able to obtain solutions with an average gap to Cplex of 4.12%. To further improve the proposed heuristic, a cooperative coevolutionary genetic programming-based hyper-heuristic has been developed. The average gap to Cplex was reduced up to 1.92%. These solutions are generated in a small fraction of a second, regardless of the size of the instance.