Author
Solyali, O., Denizel, Meltem, Süral, H.
Publication Date
2016
Publication Place
-
Informa Group
Subject
Supply chain, Multi-level lot sizing, Integer programming
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
1545-8830
Record ID
618f48af-1e3b-4621-b9ab-3156133935fe
Library Location
Industrial Engineering
Date
2016
Notes
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text
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.
DOI
10.1080/0740817X.2015.1027457
