Learning Capacity Constraints with Convex Neural Networks in Lot-Sizing Problems

References

• Abadi M, Agarwal A, Barham P, Brevdo E, Chen Z, Citro C, Corrado GS, et al. (2015) TensorFlow: Large-scale machine learning on heterogeneous systems. https://www.tensorflow.org/.Google Scholar
• Alcántara A, Ruiz C (2023a) A neural network-based distributional constraint learning methodology for mixed-integer stochastic optimization. Expert Systems Appl. 232:120895.Crossref, Google Scholar
• Alcántara A, Ruiz C (2023b) On data-driven chance constraint learning for mixed-integer optimization problems. Appl. Math. Model. 121:445–462.Crossref, Google Scholar
• Almeder C, Klabjan D, Traxler R, Almada-Lobo B (2015) Lead time considerations for the multi-level capacitated lot-sizing problem. Eur. J. Oper. Res. 241(3):727–738.Crossref, Google Scholar
• Amos B, Xu L, Kolter JZ (2017) Input convex neural networks. Internat. Conf. Machine Learn., vol. 70 (PMLR, New York), 146–155.Google Scholar
• Anderson R, Huchette J, Ma W, Tjandraatmadja C, Vielma JP (2020) Strong mixed-integer programming formulations for trained neural networks. Math. Programming 183(1–2):3–39.Crossref, Google Scholar
• Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: A methodological tour d’horizon. Eur. J. Oper. Res. 290(2):405–421.Crossref, Google Scholar
• Bezanson J, Edelman A, Karpinski S, Shah VB (2017) Julia: A fresh approach to numerical computing. SIAM Rev. 59(1):65–98.Crossref, Google Scholar
• Chen Y, Shi Y, Zhang B (2019) Optimal control via neural networks: A convex approach. Internat. Conf. Learn. Representations (New Orleans).Google Scholar
• Chorowski J, Zurada JM (2015) Learning understandable neural networks with nonnegative weight constraints. IEEE Trans. Neural Networks Learn. Systems 26(1):62–69.Crossref, Google Scholar
• Cozad A, Sahinidis NV, Miller DC (2014) Learning surrogate models for simulation-based optimization. AIChE J. 60(6):2211–2227.Crossref, Google Scholar
• Dauzère-Pérès S, Lasserre JB (1994) An Integrated Approach in Production Planning and Scheduling, vol. 411 (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• Dauzère-Pérès S, Lasserre JB (2002) On the importance of sequencing decisions in production planning and scheduling. Internat. Trans. Oper. Res. 9(6):779–793.Crossref, Google Scholar
• Diaby M, Bahl HC, Karwan MH, Zionts S (1992) A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Sci. 38(9):1329–1340.Link, Google Scholar
• Dias LS, Ierapetritou MG (2019) Data-driven feasibility analysis for the integration of planning and scheduling problems. Optim. Engrg. 20(4):1029–1066.Crossref, Google Scholar
• Drexl A, Kimms A (1997) Lot sizing and scheduling—Survey and extensions. Eur. J. Oper. Res. 99(2):221–235.Crossref, Google Scholar
• Fajemisin AO, Maragno D, den Hertog D (2024) Optimization with constraint learning: A framework and survey. Eur. J. Oper. Res. 314(1):1–14.Crossref, Google Scholar
• Federgruen A, Tzur M (1993) The dynamic lot-sizing model with backlogging: A simple O(nlogn) algorithm and minimal forecast horizon procedure. Naval Res. Logist. 40(4):459–478.Crossref, Google Scholar
• Fischetti M, Jo J (2018) Deep neural networks and mixed integer linear optimization. Constraints 23(3):296–309.Crossref, Google Scholar
• Goodfellow I, Shlens J, Szegedy C (2014) Explaining and harnessing adversarial examples Preprint, submitted December 20, https://arxiv.org/abs/1412.6572.Google Scholar
• Goodfellow I, Warde-Farley D, Mirza M, Courville A, Bengio Y (2013) Maxout networks. Internat. Conf. Machine Learn. (PMLR, New York), 1319–1327.Google Scholar
• Hopp WJ, Spearman ML (2004) To pull or not to pull: What is the question? Manufacturing Service Oper. Management 6(2):133–148.Link, Google Scholar
• Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spektrum 15:205–215.Crossref, Google Scholar
• IBM (2022a) IBM ILOG CPLEX 22.1.0. https://www.ibm.com/docs/en/icos/22.1.0?topic=cplex-optimizers.Google Scholar
• IBM (2022b) IBM ILOG CP optimizer 22.1.0. https://www.ibm.com/docs/en/icos/22.1.0?topic=cp-optimizer.Google Scholar
• Jodlbauer H, Strasser S (2019) Capacity-driven production planning. Comput. Indust. 113:103126.Crossref, Google Scholar
• Lasserre JB (1992) An integrated model for job-shop planning and scheduling. Management Sci. 38(8):1201–1211.Link, Google Scholar
• Maragno D, Wiberg H, Bertsimas D, Birbil, den Hertog D, Fajemisin AO (2023) Mixed-integer optimization with constraint learning. Oper. Res. 73(2):1011–1028.Link, Google Scholar
• Nemhauser G, Wolsey L (1988) Integer and Combinatorial Optimization (John Wiley and Sons, New York).Crossref, Google Scholar
• Rohaninejad M, Hanzálek Z (2023) Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches. Internat. J. Production Econom. 263:108958.Crossref, Google Scholar
• Rohaninejad M, Vahedi-Nouri B, Hanzálek Z, Tavakkoli-Moghaddam R (2023) An integrated lot-sizing and scheduling problem in a reconfigurable manufacturing system under workforce constraints. Internat. J. Production Res. 62(11):3994–4013.Crossref, Google Scholar
• Teichrib D, Darup MS (2023) Error bounds for Maxout neural network approximations of model predictive control. IFAC-PapersOnLine 56(2):10113–10119.Crossref, Google Scholar
• Tjeng V, Xiao KY, Tedrake R (2019) Evaluating robustness of neural networks with mixed integer programming. Internat. Conf. Learn. Representations (New Orleans).Google Scholar
• Toledo FMB, Armentano VA (2006) A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur. J. Oper. Res. 175(2):1070–1083.Crossref, Google Scholar
• Tremblet D, Thevenin S, Dolgui A (2024a) Makespan estimation in a flexible job-shop scheduling environment using machine learning. Internat. J. Production Res. 62(10):3654–3670.Crossref, Google Scholar
• Tremblet D, Thevenin S, Dolgui A (2024b) Neural networks to approximate capacity consumption in lot-sizing models. 2024 IEEE 20th Internat. Conf. Automation Sci. Engrg. (Bari, Italy), 1916–1921.Google Scholar
• Tremblet D, Thevenin S, Dolgui A (2025) Constraint learning approaches to improve the approximation of the capacity consumption function in lot-sizing models. Eur. J. Oper. Res. 322(2):679–692.Crossref, Google Scholar
• Tremblet D, Thevenin S, Dolgui A (2026) Learning capacity constraints with convex neural networks in lot-sizing problems. https://doi.org/10.1287/ijoc.2024.1033.cd, https://github.com/INFORMSJoC/2024.1033.Google Scholar
• Urrutia EDG, Aggoune R, Dauzère-Pérès S (2014) Solving the integrated lot-sizing and job-shop scheduling problem. Internat. J. Production Res. 52(17):5236–5254.Crossref, Google Scholar
• Vieira M, Moniz S, Gonçalves BS, Pinto-Varela T, Barbosa-Póvoa AP, Neto P (2021) A two-level optimisation-simulation method for production planning and scheduling: The industrial case of a human–robot collaborative assembly line. Internat. J. Production Res. 60(9):2942–2962.Crossref, Google Scholar
• Wang K, Lozano L, Cardonha C, Bergman D (2023) Optimizing over an ensemble of trained neural networks. INFORMS J. Comput. 35(3):652–674.Link, Google Scholar
• Wolosewicz C, Dauzère-Pérès S, Aggoune R (2015) A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem. Eur. J. Oper. Res. 244(1):3–12.Crossref, Google Scholar
• Wu T, Wang J (2023) Transient stability-constrained unit commitment using input convex neural network. IEEE Trans. Neural Networks Learn. Systems 35(11):16023–16035.Google Scholar
• Xie J, Gao L, Peng K, Li X, Li H (2019) Review on flexible job shop scheduling. IET Collaborative Intelligent Manufacturing 1(3):67–77.Crossref, Google Scholar
• Yang S, Bequette BW (2021) Optimization-based control using input convex neural networks. Comput. Chemical Engrg. 144:107143.Crossref, Google Scholar