Citations (89)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (19)
Kevin A. Bunn & José A. Ventura. (2023) Reformulations to improve the Lagrangian relaxation approach for the capacitated multi-product dynamic lot sizing problem with batch ordering. International Journal of Production Research 0:0, pages 1-20.
Read now
Read now
Marco Caserta & Stefan Voß. (2021) Accelerating mathematical programming techniques with the corridor method. International Journal of Production Research 59:9, pages 2739-2771.
Read now
Read now
Fangzhou Sun, Maichel M. Aguayo, Rahul Ramachandran & Subhash C. Sarin. (2018) Biomass feedstock supply chain design – a taxonomic review and a decomposition-based methodology. International Journal of Production Research 56:17, pages 5626-5659.
Read now
Read now
Zhiqiang Lu, Yuejun Zhang & Xiaole Han. (2013) Integrating run-based preventive maintenance into the capacitated lot sizing problem with reliability constraint. International Journal of Production Research 51:5, pages 1379-1391.
Read now
Read now
Ik-Soon Kwak & In-Jae Jeong. (2011) A hierarchical approach for the capacitated lot-sizing and scheduling problem with a special structure of sequence-dependent setups. International Journal of Production Research 49:24, pages 7425-7439.
Read now
Read now
Najib M. Najid, Marouane Alaoui-Selsouli & Abdelmoula Mohafid. (2011) An integrated production and maintenance planning model with time windows and shortage cost. International Journal of Production Research 49:8, pages 2265-2283.
Read now
Read now
Rosa G. González-Ramírez, Neale R. Smith & Ronald G. Askin. (2011) A heuristic approach for a multi-product capacitated lot-sizing problem with pricing. International Journal of Production Research 49:4, pages 1173-1196.
Read now
Read now
Carina
Maria Oliveira Pimentel, Filipe
Pereira e Alvelos & José
Manuel Valério de Carvalho. (2010) Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optimization Methods and Software 25:2, pages 299-319.
Read now
Read now
Sandra
Duni Ekşioğlu, Burak Ekşioğlu & H.
Edwin Romeijn. (2007) A Lagrangean heuristic for integrated production and transportation planning problems in a dynamic, multi-item, two-layer supply chain. IIE Transactions 39:2, pages 191-201.
Read now
Read now
Xiaoyan Zhu & WilbertE. Wilhelm. (2006) Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions 38:11, pages 987-1007.
Read now
Read now
Fayez F. Boctor
& Patrice Poulin. (2005) Heuristics for the N-product, M-stage, economic lot sizing and scheduling problem with dynamic demand. International Journal of Production Research 43:13, pages 2809-2828.
Read now
Read now
El-Houssaine Aghezzaf & Hendrik Van Landeghem. (2002) An integrated model for inventory and production planning in a two-stage hybrid production system. International Journal of Production Research 40:17, pages 4323-4339.
Read now
Read now
A. Alfieri, P. Brandimarte & S. D'Orazio. (2002) LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm. International Journal of Production Research 40:2, pages 441-458.
Read now
Read now
LINET ÖZDAMAR & MEHMETALI BOZYEL. (2000) The capacitated lot sizing problem with overtime decisions and setup times. IIE Transactions 32:11, pages 1043-1057.
Read now
Read now
CHARLESR. SOX & YUBO GAO. (1999) The capacitated lot sizing problem with setup carry-over. IIE Transactions 31:2, pages 173-181.
Read now
Read now
M. GOPALAKRISHNAN, D. M. MILLER & C. P. SCHMIDT. (1995) A framework for modelling setup carryover in the capacitated lot sizing problem. International Journal of Production Research 33:7, pages 1973-1988.
Read now
Read now
PAULS. DIXON & CHOON
LAY POH. (1990) Heuristic Procedures for Multi-Item Inventory Planning with Limited Storage. IIE Transactions 22:2, pages 112-123.
Read now
Read now
VICKIL. SMITH-DANIELS. (1988) A Heuristic Procedure for Scheduling Packaging Lines in Process Industries. IIE Transactions 20:3, pages 295-305.
Read now
Read now
Johan Maes & LukN. Van Wassenhove. (1986) Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part I: Static Case). IIE Transactions 18:2, pages 114-123.
Read now
Read now
Articles from other publishers (70)
Kevin A. Bunn & José A. Ventura. (2023) A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs. European Journal of Operational Research 307:1, pages 116-129.
Crossref
Crossref
Marin Lujak, Alberto Fernández & Eva Onaindia. (2021) Spillover Algorithm: A decentralised coordination approach for multi-robot production planning in open shared factories. Robotics and Computer-Integrated Manufacturing 70, pages 102110.
Crossref
Crossref
A. B. Dolgui, G. M. Levin & B. M. Rozin. (2020) Structural-Parametric Optimization of a Complex of Intersecting Sets of Operations under Nonstationary Demand. Automation and Remote Control 81:5, pages 791-802.
Crossref
Crossref
Duygu Taş, Michel Gendreau, Ola Jabali & Raf Jans. (2019) A capacitated lot sizing problem with stochastic setup times and overtime. European Journal of Operational Research 273:1, pages 146-159.
Crossref
Crossref
Ravi Ramya, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra & K. GaneshRavi Ramya, Chandrasekharan Rajendran, Hans Ziegler, Sanjay Mohapatra & K. Ganesh. 2019. Capacitated Lot Sizing Problems in Process Industries. Capacitated Lot Sizing Problems in Process Industries
1
31
.
Edwards A. Silver, David F. Pyke & Douglas J. Thomas. 2016. Inventory and Production Management in Supply Chains. Inventory and Production Management in Supply Chains
435
486
.
El-Houssaine Aghezzaf, Abdelhakim Khatab & Phuoc Le Tam. (2016) Optimizing production and imperfect preventive maintenance planning׳s integration in failure-prone manufacturing systems. Reliability Engineering & System Safety 145, pages 190-198.
Crossref
Crossref
Cathy Wolosewicz, Stéphane Dauzère-Pérès & Riad Aggoune. (2015) A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem. European Journal of Operational Research 244:1, pages 3-12.
Crossref
Crossref
Kerem Akartunalı & Andrew J. Miller. (2012) A computational analysis of lower bounds for big bucket production planning problems. Computational Optimization and Applications 53:3, pages 729-753.
Crossref
Crossref
Guillaume Lanquepin-Chesnais, Kjetil K. Haugen & Asmund Olstad. (2012) Large-Scale Joint Price-Inventory Decision Problems, Under Resource Limitation and a Discrete Price Set. Journal of Mathematical Modelling and Algorithms 11:3, pages 269-280.
Crossref
Crossref
Tao Wu, Leyuan Shi, Joseph Geunes & Kerem Akartunalı. (2011) An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. European Journal of Operational Research 214:2, pages 428-441.
Crossref
Crossref
Lisbeth Buschkühl, Florian Sahling, Stefan Helber & Horst Tempelmeier. (2008) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum 32:2, pages 231-261.
Crossref
Crossref
M.B. Fakhrzad & H. Khademi Zare. (2009) Combination of genetic algorithm with Lagrange multipliers for lot-size determination in multi-stage production scheduling problems. Expert Systems with Applications 36:6, pages 10180-10187.
Crossref
Crossref
Marianthi Ierapetritou & Zukui Li. 2009. Optimization and Logistics Challenges in the Enterprise. Optimization and Logistics Challenges in the Enterprise
97
144
.
Michael Comelli, Michel Gourgand & David Lemoine. (2008) A review of tactical planning models. Journal of Systems Science and Systems Engineering 17:2, pages 204-229.
Crossref
Crossref
Daniel Quadt & Heinrich Kuhn. (2007) Capacitated lot-sizing with extensions: a review. 4OR 6:1, pages 61-83.
Crossref
Crossref
Charles Sung & Christos T. Maravelias. (2008) A mixed-integer programming formulation for the general capacitated lot-sizing problem. Computers & Chemical Engineering 32:1-2, pages 244-259.
Crossref
Crossref
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 55:5, pages 909-920.
Crossref
Crossref
Raf Jans & Zeger Degraeve. (2007) Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. European Journal of Operational Research 177:3, pages 1855-1875.
Crossref
Crossref
Kjetil K. Haugen, Asmund Olstad & Bård I. Pettersen. (2006) Solving Large-scale Profit Maximization Capacitated Lot-size Problems by Heuristic Methods. Journal of Mathematical Modelling and Algorithms 6:1, pages 135-149.
Crossref
Crossref
Kjetil K. Haugen, Asmund Olstad & Bård I. Pettersen. (2007) The profit maximizing capacitated lot-size (PCLSP) problem. European Journal of Operational Research 176:1, pages 165-176.
Crossref
Crossref
Michael Comelli, Michel Gourgand & David Lemoine. (2006) A review of tactical planning models. A review of tactical planning models.
Nafee Rizk, Alain Martel & Amar Ramudhin. (2006) A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs. International Journal of Production Economics 102:2, pages 344-357.
Crossref
Crossref
Dan Wu & Marianthi Ierapetritou. (2006) Lagrangean decomposition using an improved Nelder–Mead approach for Lagrangean multiplier update. Computers & Chemical Engineering 30:5, pages 778-789.
Crossref
Crossref
Daoming Dai, Chengbin Chu & Shanlin Yang. (2006) The Optimal Pricing and Multi-Item Capacitated Lot Sizing Problem. The Optimal Pricing and Multi-Item Capacitated Lot Sizing Problem.
Alain Martel, Nafee Rizk, Sophie D'Amours & Hanen Bouchriha. 2005. Logistics Systems: Design and Optimization. Logistics Systems: Design and Optimization
323
350
.
E. Powell Robinson & F. Barry Lawrence. (2004) Coordinated Capacitated Lot-Sizing Problem with Dynamic Demand: A Lagrangian Heuristic. Decision Sciences 35:1, pages 25-53.
Crossref
Crossref
B. Karimi, S.M.T. Fatemi Ghomi & J.M. Wilson. (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:5, pages 365-378.
Crossref
Crossref
Christopher Suerie & Hartmut Stadtler. (2003) The Capacitated Lot-Sizing Problem with Linked Lot Sizes. Management Science 49:8, pages 1039-1054.
Crossref
Crossref
M.Selim Akturk & Siraceddin Onen. (2002) Dynamic lot sizing and tool management in automated manufacturing systems. Computers & Operations Research 29:8, pages 1059-1079.
Crossref
Crossref
N. Brahimi, S. Dauzere-Peres, N. Najid & A. Nordli. (2002) A review of single item lot sizing problems. A review of single item lot sizing problems.
Gaetan Belvaux & Laurence A. Wolsey. (2001) Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs. Management Science 47:7, pages 993-1007.
Crossref
Crossref
Yves Pochet. 2001. Computational Combinatorial Optimization. Computational Combinatorial Optimization
57
111
.
Linet Özdamar & Gülay Barbarosoglu. (2000) An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem. International Journal of Production Economics 68:3, pages 319-331.
Crossref
Crossref
R. Kolisch. (2000) Integration of assembly and fabrication for make-to-order production. International Journal of Production Economics 68:3, pages 287-306.
Crossref
Crossref
Gaetan Belvaux & Laurence A. Wolsey. (2000) bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems. Management Science 46:5, pages 724-738.
Crossref
Crossref
H.A.M. Soltan. 2000. Current Advances in Mechanical Design and Production VII. Current Advances in Mechanical Design and Production VII
603
610
.
O. du Merle, J.-L. Goffin, C. Trouiller & J.-P. Vial. 2000. Approximation and Complexity in Numerical Optimization. Approximation and Complexity in Numerical Optimization
380
405
.
Anshuman Gupta & Costas D. Maranas. (1999) A Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems. Industrial & Engineering Chemistry Research 38:5, pages 1937-1947.
Crossref
Crossref
Sungmin Kang, Kavindra Malik & L. Joseph Thomas. (1999) Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs. Management Science 45:2, pages 273-289.
Crossref
Crossref
Yi-Feng Hung & Yi-Cheng Hu. (1998) Solving mixed integer programming production planning problems with setups by shadow price information. Computers & Operations Research 25:12, pages 1027-1042.
Crossref
Crossref
Linet Özdamar & Şevket İlker Birbil. (1998) Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. European Journal of Operational Research 110:3, pages 525-547.
Crossref
Crossref
Bernhard Fleischmann & Herbert Meyr. (1997) The general lotsizing and scheduling problem. Operations-Research-Spektrum 19:1, pages 11-21.
Crossref
Crossref
Belarmino Adenso‐Diaz & Manuel Laguna. (2009) A TECHNIQUE TO MINIMIZE OVERTIME IN THE CAPACITATED MRP PROBLEM. Production and Operations Management 5:4, pages 357-370.
Crossref
Crossref
Knut Haase. (1996) Capacitated lot-sizing with sequence dependent setup costs. Operations-Research-Spektrum 18:1, pages 51-59.
Crossref
Crossref
Knut Haase & Udo Kohlmorgen. 1996. Operations Research Proceedings 1995. Operations Research Proceedings 1995
370
375
.
U. Brännlund, K. C. Kiwiel & P. O. Lindberg. 1996. System Modelling and Optimization. System Modelling and Optimization
387
394
.
Bernhard Fleischmann. (1994) The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. European Journal of Operational Research 75:2, pages 395-404.
Crossref
Crossref
Stan van Hoesel & Antoon Kolen. (1994) A linear description of the discrete lot-sizing and scheduling problem. European Journal of Operational Research 75:2, pages 342-353.
Crossref
Crossref
Ömer Kirca & Melih Kökten. (1994) A new heuristic approach for the multi-item dynamic lot sizing problem. European Journal of Operational Research 75:2, pages 332-341.
Crossref
Crossref
Knut Haase & Andreas Drexl. 1994. Operations Research ’93. Operations Research ’93
212
215
.
Edward J. Anderson & Boon Soon Cheah. (1993) Capacitated lot-sizing with minimum batch sizes and setup times. International Journal of Production Economics 30-31, pages 137-152.
Crossref
Crossref
Huan Neng Chiu. (1993) A cost saving technique for solving capacitated multi-stage lot-sizing problems. Computers & Industrial Engineering 24:3, pages 367-377.
Crossref
Crossref
Rohit Bhatnagar, Pankaj Chandra & Suresh K. Goyal. (1993) Models for multi-plant coordination. European Journal of Operational Research 67:2, pages 141-160.
Crossref
Crossref
Meltem Denizel-Sivri & S. Selcuk Erenguc. (1993) A polynomial algorithm for a multi-item capacitated production planning problem. Operations Research Letters 13:5, pages 287-293.
Crossref
Crossref
Horst Tempelmeier & Matthias Derstroff. (1993) Mehrstufige Mehrprodukt-Losgrößenplanung bei beschränkten Ressourcen und genereller Erzeugnisstruktur. OR Spektrum 15:2, pages 63-73.
Crossref
Crossref
Reza Eftekharzadeh. (1993) A Comprehensive Review of Production Lot‐sizing. International Journal of Physical Distribution & Logistics Management 23:1, pages 30-44.
Crossref
Crossref
Kenneth R. Baker. 1993. Logistics of Production and Inventory. Logistics of Production and Inventory
571
627
.
GERARD M. CAMPBELL. (2009) USING SHORT‐TERM DEDICATION FOR SCHEDULING MULTIPLE PRODUCTS ON PARALLEL MACHINES. Production and Operations Management 1:3, pages 295-307.
Crossref
Crossref
Johan Maes, John O. McClain & Luk N. Van Wassenhove. (1991) Multilevel capacitated lotsizing complexity and LP-based heuristics. European Journal of Operational Research 53:2, pages 131-148.
Crossref
Crossref
Sebastian Lozano, Juan Larraneta & Luis Onieva. (1991) Primal-dual approach to the single level capacitated lot-sizing problem. European Journal of Operational Research 51:3, pages 354-366.
Crossref
Crossref
Yaakov Roll & Reuven Karni. (1991) Multi-item, multi-level lot sizing with an aggregate capacity constraint. European Journal of Operational Research 51:1, pages 73-87.
Crossref
Crossref
W. -H. Chen & J. -M. Thizy. (1990) Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annals of Operations Research 26:1-4, pages 29-72.
Crossref
Crossref
Dirk Cattrysse, Johan Maes & Luk N. Van Wassenhove. (1990) Set partitioning and column generation heuristics for capacitated dynamic lotsizing. European Journal of Operational Research 46:1, pages 38-47.
Crossref
Crossref
Ömer Kirca. (1990) An efficient algorithm for the capacitated single item dynamic lot size problem. European Journal of Operational Research 45:1, pages 15-24.
Crossref
Crossref
Bernhard Fleischmann. (1990) The discrete lot-sizing and scheduling problem. European Journal of Operational Research 44:3, pages 337-348.
Crossref
Crossref
William W. Trigeiro. (1989) A Simple Heuristic for Lot Sizing with Setup Times. Decision Sciences 20:2, pages 294-303.
Crossref
Crossref
W.G.N.L.U. De Silva & R.P. Mohanty. (1987) An Evaluation of the State of Research in the Economic Lot Sizing Problem. Management Research News 10:1, pages 15-19.
Crossref
Crossref
Mehdi Charles, Stephane Dauzere-Peres, Safia Kedad-Sidhoum & Issam Mazhoud. (2022) Parallelized Decomposition Approaches to Solve the Capacitated Lot-Sizing Problem with Setup Times and Constraints on Ending Inventories. SSRN Electronic Journal.
Crossref
Crossref
Chen Zhen & Zhang Renqian. (2015) A Single Item Lot Sizing Problem Considering Capital Flow and Trade Credit. SSRN Electronic Journal.
Crossref
Crossref