Access the full text.
Sign up today, get DeepDyve free for 14 days.
R Jans, Z Degraeve (2008)
Modeling industrial lot sizing problems: a reviewInt. J. Prod. Res., 46
GL Nemhauser, LA Wolsey (1999)
Integer and Combinatorial Optimization
M Caserta, E Quiñonez (2009)
A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setupsComput. Oper. Res., 36
F Marinelli, ME Nenni, A Sforza (2007)
Capacitated lot sizing and scheduling with parallel machines and shared buffers: a case study in a packaging companyAnn. Oper. Res., 150
W Domschke, A Scholl, S Voß (1997)
Produktionsplanung: Ablauforganisatorische Aspekte
WW Trigeiro, LJ Thomas, JO McClain (1989)
Capacitated lot-sizing with setup timesManage. Sci., 35
C Barnhart, EL Johnson, GL Nemhauser, MWP Savelsbergh, PH Vance (1998)
Branch and price: column generation for huge integer programsOper. Res, 46
S Voß, DL Woodruff (2006)
An Introduction to Computational Optimization Models for Production Planning in a Supply Chain
HM Wagner, TM Whitin (1958)
Dynamic version of the economic lot size modelManage. Sci., 5
R Jans, Z Degraeve (2007)
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approachesEur. J. Oper. Res., 177
MAH Dzielinski, RE Gomory (1965)
Optimal programming of lot-sizing inventory and labor allocationManage. Sci., 11
S Voß (1999)
The Steiner tree problem with hop constraintsAnn. Oper. Res., 86
AS Manne (1958)
Programming of economic lot sizesManage. Sci., 4
F Vanderbeck, MWP Savelsbergh (2006)
A generic view of Dantzig-Wolfe decomposition in mixed integer programmingOper. Res. Lett., 34
M Constantino (1996)
A cutting plane approach to capacitated lot-sizing with start-up costsMath. Program., B75
M Sniedovich, S Voß (2006)
The corridor method: a dynamic programming inspired metaheuristicControl Cybern., 35
GD Eppen, RK Martin (1987)
Solving multi-item lot-sizing problems using variable redefinitionOper. Res., 35
S Nahmias (1982)
Perishable inventory theory: a reviewOper. Res., 30
RE Erickson, CL Monma, AF Veinott (1987)
Send-and-split methods for minimum-concave-cost network flowsMath. Oper. Res., 12
R Jans, Z Degraeve (2007)
A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with setup timesOper. Res., 55
GEP Box, KB Wilson (1951)
On the experimental attainment of optimum conditionsJ. R. Stat. Soc. Ser. B, 13
G Bruno, A Genovese, A Sgalambro (2012)
An extension of the schedule optimization problem at a public transit terminal to the multiple destinations casePublic Transp., 3
Y Pochet, LA Wolsey (1994)
Polyhedra for lot sizing with Wagner-Whitin costsMath. Program. B, 67
GB Dantzig, P Wolfe (1960)
Decomposition principle for linear programsOper. Res., 8
G Belvaux, LA Wolsey (2000)
BC-PROD: a specialized branch-and-cut system for lot-sizing problemsManage. Sci., 46
The multi-item multi-period capacitated lot sizing problem with setups (CLST) is a well known optimization problem with wide applicability in real-world production planning problems. Based on a recently proposed Dantzig-Wolfe approach we present a novel math-heuristic algorithm for the CLST. The major contribution of this paper lies in the presentation of an algorithm that exploits exact techniques (Dantzig-Wolfe) in a metaheuristic fashion, in line with the novel trend of math-heuristic algorithms. To the best of the authors’ knowledge, it is the first time that such technique is employed within a metaheuristic framework, with the aim of tackling challenging instances in short computational time. Moreover, we provide reasoning that the approach may be beneficial when additional constraints like perishability constraints are added. This also constitutes an important extension when looking at it from the view of solution methods.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Mar 28, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.