Effective network formulations for lot sizing with backlogging in two-level serial supply chains

Oguz Solyali, Meltem Denizel and Haldun Süral

IISE Transactions, 2016, vol. 48, issue 2, 146-157

Abstract: This study considers the serial lot sizing problem with backlogging in two-level supply chains to determine when and how much to order at a warehouse and ship to a retailer over a T-period planning horizon so that the external known demand occurring at the retailer is satisfied and the total cost at all levels is minimized. In particular, the uncapacitated two-level serial lot sizing problem with backlogging and the two-level serial lot sizing problem with cargo capacity and backlogging are formulated using effective shortest-path network representations, which define the convex hull of their feasible solutions. These representations lead to efficient algorithms with O(T3) time for the uncapacitated problem and O(T6) time for the capacitated problem. Furthermore, a tight reformulation with O(T3) variables and O(T2) constraints (resp. O(T6) variables and O(T5) constraints) is proposed for the uncapacitated (resp. capacitated) problem.

Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2015.1027457 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:48:y:2016:i:2:p:146-157

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2015.1027457

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().