Late Acceptance Hill-Climbing Matheuristic for the General Lot Sizing and Scheduling Problem with Rich Constraints

This paper considers the general lot sizing and scheduling problem with rich constraints exemplified by means of rework and lifetime constraints for defective items (GLSP-RP), which finds numerous applications in industrial settings, for example, the food processing industry and the pharmaceutical i...

Full description

Saved in:
Bibliographic Details
Published inAlgorithms Vol. 13; no. 6; p. 138
Main Authors Goerler, Andreas, Lalla-Ruiz, Eduardo, Voß, Stefan
Format Journal Article
LanguageEnglish
Published MDPI AG 01.06.2020
Subjects
late acceptance hill-climbing
lifetime constraints
lot sizing
matheuristic
rework
scheduling
Online AccessGet full text

Cover

More Information
Summary:This paper considers the general lot sizing and scheduling problem with rich constraints exemplified by means of rework and lifetime constraints for defective items (GLSP-RP), which finds numerous applications in industrial settings, for example, the food processing industry and the pharmaceutical industry. To address this problem, we propose the Late Acceptance Hill-climbing Matheuristic (LAHCM) as a novel solution framework that exploits and integrates the late acceptance hill climbing algorithm and exact approaches for speeding up the solution process in comparison to solving the problem by means of a general solver. The computational results show the benefits of incorporating exact approaches within the LAHCM template leading to high-quality solutions within short computational times.
ISSN:1999-4893
1999-4893
DOI:10.3390/a13060138