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

詳細記述

書誌詳細

主要な著者:	Andreas Goerler, Eduardo Lalla-Ruiz, Stefan Voß
フォーマット:	Artigo
言語:	Inglês
出版事項:	MDPI AG 2020-06-01
シリーズ:	Algorithms
主題:	matheuristic late acceptance hill-climbing lot sizing scheduling rework lifetime constraints
オンライン･アクセス:	https://www.mdpi.com/1999-4893/13/6/138
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!