Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
Author
Abstract
Suggested Citation
DOI: 10.1287/ijoc.2017.0746
Download full text from publisher
References listed on IDEAS
- Gary D. Eppen & R. Kipp Martin, 1987. "Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition," Operations Research, INFORMS, vol. 35(6), pages 832-848, December.
- Stadtler, Hartmut, 2003. "Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20204, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- Ioannis Fragkos & Zeger Degraeve & Bert De Reyck, 2016. "A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 465-482, August.
- Gramani, Maria Cristina N. & Franca, Paulo M., 2006. "The combined cutting stock and lot-sizing problem in industrial processes," European Journal of Operational Research, Elsevier, vol. 174(1), pages 509-521, October.
- ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
- Zeger Degraeve & Raf Jans, 2007. "A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times," Operations Research, INFORMS, vol. 55(5), pages 909-920, October.
- Valerio de Carvalho, J. M. & Guimaraes Rodrigues, A. J., 1995. "An LP-based approach to a two-stage cutting stock problem," European Journal of Operational Research, Elsevier, vol. 84(3), pages 580-589, August.
- ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
- Nonas, Sigrid Lise & Thorstenson, Anders, 2000. "A combined cutting-stock and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 327-342, January.
- François Clautiaux & Cláudio Alves & José Valério de Carvalho, 2010. "A survey of dual-feasible and superadditive functions," Annals of Operations Research, Springer, vol. 179(1), pages 317-342, September.
- Hatem Ben Amor & José Valério de Carvalho, 2005. "Cutting Stock Problems," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 131-161, Springer.
- Robert W. Haessler, 1975. "Controlling Cutting Pattern Changes in One-Dimensional Trim Problems," Operations Research, INFORMS, vol. 23(3), pages 483-493, June.
- Elena V. Krichagina & Rodrigo Rubio & Michael I. Taksar & Lawrence M. Wein, 1998. "A Dynamic Stochastic Stock-Cutting Problem," Operations Research, INFORMS, vol. 46(5), pages 690-701, October.
- Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
- Robert W. Haessler, 1988. "Selection and Design of Heuristic Procedures for Solving Roll Trim Problems," Management Science, INFORMS, vol. 34(12), pages 1460-1471, December.
- Hartmut Stadtler, 2003. "Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows," Operations Research, INFORMS, vol. 51(3), pages 487-502, June.
- P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
- Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
- Robert W. Haessler, 1971. "A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem," Management Science, INFORMS, vol. 17(12), pages 793-802, August.
- ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
- ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
- Wu, Tao & Shi, Leyuan & Geunes, Joseph & AkartunalI, Kerem, 2011. "An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging," European Journal of Operational Research, Elsevier, vol. 214(2), pages 428-441, October.
- Arbib, Claudio & Marinelli, Fabrizio, 2005. "Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application," European Journal of Operational Research, Elsevier, vol. 163(3), pages 617-630, June.
- Tao Wu & Leyuan Shi & Joseph Geunes & Kerem Akartunalı, 2012. "On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times," Journal of Global Optimization, Springer, vol. 53(4), pages 615-639, August.
- P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
- Sônia Poltroniere & Kelly Poldi & Franklina Toledo & Marcos Arenales, 2008. "A coupling cutting stock-lot sizing problem in the paper industry," Annals of Operations Research, Springer, vol. 157(1), pages 91-104, January.
- Zeger Degraeve & Marc Peeters, 2003. "Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 58-81, February.
- François Vanderbeck, 2000. "Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem," Operations Research, INFORMS, vol. 48(6), pages 915-926, December.
- Claudio Arbib & Fabrizio Marinelli & Fabrizio Rossi & Francesco Di Iorio, 2002. "Cutting and Reuse: An Application from Automobile Component Manufacturing," Operations Research, INFORMS, vol. 50(6), pages 923-934, December.
- AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
- ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
- I. Coverdale & F. Wharton, 1976. "An Improved Heuristic Procedure for a Nonlinear Cutting Stock Problem," Management Science, INFORMS, vol. 23(1), pages 78-86, September.
- Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
- Vahrenkamp, Richard, 1996. "Random search in the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 95(1), pages 191-200, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Wu, Tao & Huang, Le & Liang, Zhe & Zhang, Xiaoning & Zhang, Canrong, 2022. "A supervised learning-driven heuristic for solving the facility location and production planning problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 785-796.
- Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
- Hao, Xinye & Zheng, Li & Li, Na & Zhang, Canrong, 2022. "Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process," European Journal of Operational Research, Elsevier, vol. 303(2), pages 581-592.
- Tao Wu & Zhe Liang & Canrong Zhang, 2018. "Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 236-258, May.
- Simon Thevenin & Yossiri Adulyasak & Jean-François Cordeau, 2022. "Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3151-3169, November.
- Gislaine Mara Melega & Silvio Alexandre de Araujo & Reinaldo Morabito, 2020. "Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems," Annals of Operations Research, Springer, vol. 295(2), pages 695-736, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
- Tao Wu & Zhe Liang & Canrong Zhang, 2018. "Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 236-258, May.
- Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
- Ioannis Fragkos & Zeger Degraeve & Bert De Reyck, 2016. "A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 465-482, August.
- François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
- Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
- Silva, Eduardo M. & Melega, Gislaine M. & Akartunalı, Kerem & de Araujo, Silvio A., 2023. "Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost," European Journal of Operational Research, Elsevier, vol. 304(2), pages 443-460.
- Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
- Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
- Gleb Belov & Guntram Scheithauer, 2007. "Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 27-35, February.
- Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
- B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
- Peeters, Marc & Degraeve, Zeger, 2006. "Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem," European Journal of Operational Research, Elsevier, vol. 170(2), pages 416-439, April.
- Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
- Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
- Reinertsen, Harald & Vossen, Thomas W.M., 2010. "The one-dimensional cutting stock problem with due dates," European Journal of Operational Research, Elsevier, vol. 201(3), pages 701-711, March.
- Alves, Claudio & Valerio de Carvalho, J.M., 2007. "Accelerating column generation for variable sized bin-packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1333-1352, December.
- Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
- Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
More about this item
Keywords
integer programming; cutting stock; lot sizing; heuristics; column generation; Dantzig–Wolfe decomposition;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:29:y:2017:i:3:p:523-543. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.