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

• Published in: Algorithms Vol. 13; no. 6; p. 138
• Main Authors: Goerler, Andreas, Lalla-Ruiz, Eduardo, Voß, Stefan
• Format: Journal Article
• Language: English
• Published: MDPI AG 01.06.2020
• Subjects: late acceptance hill-climbing; lifetime constraints; lot sizing; matheuristic; rework; scheduling

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...