Effective network formulations for lot sizing with backlogging in two-level serial supply chains. Issue 2 (1st February 2016)

• Record Type: Journal Article
• Authors: Solyali, Oguz; Denizel, Meltem; Süral, Haldun
• Is Part Of: IIE transactions. Volume 48:Issue 2(2016)
• Page Start: 146
• Page End: 157
• Publication Date: 2016-02-01
• Subjects: Supply chain -- multi-level lot sizing -- integer programming; Industrial engineering -- Periodicals; Génie industriel; 620
• DOI: 10.1080/0740817X.2015.1027457
• Languages: English
• ISSNs: 0740-817X

Abstract

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 ( T 3 ) time for the uncapacitated problem and O ( T 6 ) time for the capacitated problem. Furthermore, a tight reformulation with O ( T 3 ) variables and O ( T 2 ) constraints (resp. O ( T 6 ) variables and O ( T 5 ) constraints) is proposed for the uncapacitated (resp. capacitated) problem.