The Capacitated Lot-Sizing Problem with Linked Lot Sizes
Year of publication: |
2003
|
---|---|
Authors: | Suerie, Christopher ; Stadtler, Hartmut |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 49.2003, 8, p. 1039-1054
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | Lot-Sizing | MIP | Valid Inequalities | CLSPL |
-
Valid inequalities for two-period relaxations of big-bucket lot-sizing problems : zero setup case
Doostmohammadi, Mahdi, (2018)
-
A theoretical and computational analysis of lot-sizing in remanufacturing with separate setups
Sharifah Aishah Syed Ali, (2018)
-
A branch-and-cut algorithm for the inventory routing problem with product substitution
Mahmutoğulları, Özlem, (2023)
- More ...
-
The Capacitated Lot-Sizing Problem with Linked Lot Sizes
Suerie, Christopher, (2003)
-
Advanced Planning in Supply Chains : Illustrating the Concepts Using an SAP® APO Case Study
Stadtler, Hartmut, (2012)
-
The Capacitated lot-sizing problem with linked lot sizes
Suerie, Christopher, (2003)
- More ...