ORCID Profile
0000-0003-0169-3833
Current Organisation
University Of Strathclyde
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Society for Industrial & Applied Mathematics (SIAM)
Date: 2017
DOI: 10.1137/17M1114247
Publisher: Informa UK Limited
Date: 07-10-2022
Publisher: Elsevier BV
Date: 02-2018
Publisher: Elsevier BV
Date: 03-2009
Publisher: Informa UK Limited
Date: 24-10-2017
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 08-2017
Abstract: The coupled lot-sizing and cutting-stock problem has been a challenging and significant problem for industry, and has therefore received sustained research attention. The quality of the solution is a major determinant of cost performance in related production and inventory management systems, and therefore there is intense pressure to develop effective practical solutions. In the literature, a number of heuristics have been proposed for solving the problem. However, the heuristics are limited in obtaining high solution qualities. This paper proposes a new progressive selection algorithm that hybridizes heuristic search and extended reformulation into a single framework. The method has the advantage of generating a strong bound using the extended reformulation, which can provide good guidelines on partitioning and s ling in the heuristic search procedure to ensure an efficient solution process. We also analyze per-item and per-period Dantzig–Wolfe decompositions of the problem and present theoretical comparisons. The master problem of the per period Dantzig–Wolfe decomposition is often degenerate, which results in a tailing-off effect for column generation. We apply a hybridization of Lagrangian relaxation and stabilization techniques to improve the convergence. The discussion is followed by extensive computational tests, where we also perform detailed statistical analyses on various parameters. Comparisons with other methods indicate that our approach is computationally tractable and is able to obtain improved results. The online supplement is available at 0.1287/ijoc.2017.0746 .
Publisher: Elsevier BV
Date: 05-2018
Publisher: Elsevier BV
Date: 06-2017
Publisher: Elsevier BV
Date: 04-2017
Publisher: Springer Science and Business Media LLC
Date: 02-07-2015
Publisher: Springer International Publishing
Date: 2017
Publisher: FapUNIFESP (SciELO)
Date: 2021
Publisher: Springer International Publishing
Date: 2016
Publisher: Elsevier BV
Date: 04-2015
Publisher: Informa UK Limited
Date: 26-05-2021
Publisher: Elsevier BV
Date: 03-2013
Publisher: Informa UK Limited
Date: 27-08-2019
Publisher: Springer Science and Business Media LLC
Date: 05-07-2012
Publisher: Elsevier BV
Date: 10-2022
Publisher: Elsevier BV
Date: 10-2011
Publisher: Springer Science and Business Media LLC
Date: 29-06-2021
DOI: 10.1007/S11590-021-01768-3
Abstract: In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single item in every time period. The problem seeks a solution that determines how much to produce and carry at each time period, so that we will incur the least amount of production and inventory cost. When the remanufacturing option is included, the input comprises of number of returned products at each time period that can be potentially remanufactured to satisfy the demands, where remanufacturing and inventory costs are applicable. For this problem, we first show that it cannot have a fully polynomial time approximation scheme. We then provide a polynomial time algorithm, when we make certain realistic assumptions on the cost structure.
Publisher: Elsevier BV
Date: 2023
Publisher: Springer Science and Business Media LLC
Date: 09-02-2012
Publisher: Elsevier BV
Date: 2021
Publisher: Elsevier BV
Date: 03-2013
Publisher: Springer Science and Business Media LLC
Date: 31-05-2011
Publisher: Informa UK Limited
Date: 07-08-2020
Publisher: Elsevier BV
Date: 11-2015
Publisher: Springer Science and Business Media LLC
Date: 22-09-2017
Publisher: Elsevier BV
Date: 11-2020
Publisher: Elsevier BV
Date: 07-2021
Publisher: Informa UK Limited
Date: 09-11-2017
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 11-2016
Abstract: Despite the significant attention they have drawn, big-bucket lot-sizing problems remain notoriously difficult to solve. Previous literature contained results (computational and theoretical) indicating that what makes these problems difficult are the embedded single-machine, single-level, multiperiod submodels. We therefore consider the simplest such submodel, a multi-item, two-period capacitated relaxation. We propose a methodology that can approximate the convex hulls of all such possible relaxations by generating violated valid inequalities. To generate such inequalities, we separate two-period projections of fractional linear programming solutions from the convex hulls of the two-period closure we study. The convex hull representation of the two-period closure is generated dynamically using column generation. Contrary to regular column generation, our method is an outer approximation and can therefore be used efficiently in a regular branch-and-bound procedure. We present computational results that illustrate how these two-period models could be effective in solving complicated problems.
Publisher: FapUNIFESP (SciELO)
Date: 2021
Publisher: Elsevier BV
Date: 09-2018
Location: United Kingdom of Great Britain and Northern Ireland
Start Date: 2014
End Date: 2015
Funder: Engineering and Physical Sciences Research Council
View Funded Activity