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

Cijeli opis

Bibliografski detalji

Glavni autori:	Andreas Goerler, Eduardo Lalla-Ruiz, Stefan Voß
Format:	Artigo
Jezik:	Inglês
Izdano:	MDPI AG 2020-06-01
Serija:	Algorithms
Teme:	matheuristic late acceptance hill-climbing lot sizing scheduling rework lifetime constraints
Online pristup:	https://www.mdpi.com/1999-4893/13/6/138
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!