An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging

Wu, Tao and Shi, Leyuan and Geunes, Joseph and Akartunali, Kerem (2011) An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. European Journal of Operational Research, 214 (2). pp. 428-441. ISSN 0377-2217

[img]
Preview
 PDF (Akartunali EJOR Preprint version)
ejor_prefinal.pdf
Accepted Author Manuscript
License: Unspecified
Download (971kB)| Preview

    Abstract

    This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear programming relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield the same lower bounds. In addition to these theoretical results, we propose a new, effective optimization framework that achieves high quality solutions in reasonable computational time. Computational results show that the proposed optimization framework is superior to other well-known approaches on several important performance dimensions.

    Creators(s): Wu, Tao, Shi, Leyuan, Geunes, Joseph and Akartunali, Kerem ORCID logoORCID: https://orcid.org/0000-0003-0169-3833;
    Item type:Article
    ID code:37401
    Keywords:capacitated, multi-level, lot-sizing, backlogging, lower and upper bound guided nested, partitions, Management. Industrial Management, Modelling and Simulation, Management Science and Operations Research, Information Systems and Management
    Subjects:Social Sciences > Industries. Land use. Labor > Management. Industrial Management
    Department:Strathclyde Business School > Management Science
    Depositing user: Pure Administrator
    Date deposited:06 Feb 2012 12:08
    Last modified:03 Jun 2020 00:25
    URI:https://strathprints.strath.ac.uk/id/eprint/37401
    Export data:
    CORE (COnnecting REpositories)