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

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

Bibliographic Details
Main Authors: Andreas Goerler, Eduardo Lalla-Ruiz, Stefan Voß
Format: Article
Language:English
Published: MDPI AG 2020-06-01
Series:Algorithms
Subjects:
matheuristic
late acceptance hill-climbing
lot sizing
scheduling
rework
lifetime constraints
Online Access:https://www.mdpi.com/1999-4893/13/6/138

Internet

https://www.mdpi.com/1999-4893/13/6/138

Similar Items