Lagrangian based approach to solve a two level capacitated lot sizing problem
Two-level, multi-item, multi-period-capacitated dynamic lot-sizing problem with inclusions of backorders and setup times, TL_CLSP_BS, a well-known NP-hard problem, is solved using a novel procedure. Lagrangian relaxation of the material balance constraint reduces TL_CLSP_BS to a single-constraint co...
Main Authors: | Mayank Verma, R.R.K. Sharma |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2015-12-01
|
Series: | Cogent Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/23311916.2015.1008861 |
Similar Items
-
Lower bound on size of branch-and-bound trees for solving lot-sizing problem
by: Dey, S.S, et al.
Published: (2022) -
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs
by: Flavio Molina, et al.
Published: (2009-08-01) -
A capacitated lot sizing procedure for material requirement planning systems
by: Al-sous, Imad Mohamed
Published: (2008) -
Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
by: Erromdhani Ridha, et al.
Published: (2017-01-01) -
On the single level capacitated lot sizing problem.
Published: (1998)