{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:21:13Z","timestamp":1759332073721,"version":"3.37.3"},"reference-count":47,"publisher":"Informa UK Limited","issue":"8","funder":[{"DOI":"10.13039\/100006300","name":"College of Engineering ROCKET Seed Grant Program of Penn State University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006300","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2024,4,17]]},"DOI":"10.1080\/00207543.2023.2237120","type":"journal-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T04:56:45Z","timestamp":1690174605000},"page":"2868-2887","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["Reformulations to improve the Lagrangian relaxation approach for the capacitated multi-product dynamic lot sizing problem with batch ordering"],"prefix":"10.1080","volume":"62","author":[{"given":"Kevin A.","family":"Bunn","sequence":"first","affiliation":[{"name":"Amazon, Seattle, USA"}]},{"given":"Jos\u00e9 A.","family":"Ventura","sequence":"additional","affiliation":[{"name":"Harold and Inge Marcus Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, PA, USA"}]}],"member":"301","published-online":{"date-parts":[[2023,7,23]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.01.011"},{"key":"e_1_3_4_3_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"Ahuja, R. K., Orlin, J. B., and Magnanti, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ: Prentice-Hall, Inc."},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.07.028"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.02.052"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.060"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-5273(93)90087-2"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0202-9"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.1.63"},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.05.008"},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-014-0266-3"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-008-0150-7"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2010.532908"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90201-J"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408179008964163"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.9.508"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2016.03.001"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367064.1367074"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2018.12.013"},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.1.12"},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.26.7.669"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2006.08.006"},{"key":"e_1_3_4_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-008-1447-z"},{"key":"e_1_3_4_24_1","volume-title":"International Workshop on Lot Sizing","author":"Goisque G.","year":"2016","unstructured":"Goisque, G. and Rapine, C. (2016). \u201cPolynomial Time Algorithm for Multi-Level in Series Capacitated lot-Sizing Problems with Constant Batch Size. International Workshop on Lot Sizing, August 2016, Hanovre, Germany."},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580223"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01603-0"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.11.001"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540600902262"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(03)00059-8"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1070.0305"},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2019.1018"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0121"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2011.626459"},{"key":"e_1_3_4_34_1","unstructured":"Mathworks (2023). Linear Programming and Mixed-Integer Linear Programming. Intlinprog Documentation. Published online 1994-2023: https:\/\/www.mathworks.com\/help\/optim\/linear-programming-and-mixed-integer-linear-programming.html?s_tid=CRUX_topnav."},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-5273(94)90042-6"},{"key":"e_1_3_4_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2011.05.017"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.09.015"},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2010.532916"},{"key":"e_1_3_4_39_1","first-page":"64","article-title":"A Heuristic for Selecting Lot Size Quantities for the Case of a Deterministic Time Varying Demand Rate and Discrete Opportunities for Replenishment","volume":"14","author":"Silver E. A.","year":"1973","unstructured":"Silver, E. A., and H. C. Meal. 1973. \u201cA Heuristic for Selecting Lot Size Quantities for the Case of a Deterministic Time Varying Demand Rate and Discrete Opportunities for Replenishment.\u201d Production and Inventory Management 14: 64\u201374.","journal-title":"Production and Inventory Management"},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408178508975308"},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540701675833"},{"key":"e_1_3_4_42_1","volume-title":"Investigation of a Class of Constrained Inventory Problems","author":"Vander Eecken J.","year":"1968","unstructured":"Vander Eecken, J. 1968. Investigation of a Class of Constrained Inventory Problems. New Haven, CT: Dissertation. Business Administration, Yale University."},{"key":"e_1_3_4_43_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1070.0257"},{"key":"e_1_3_4_44_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.89"},{"key":"e_1_3_4_45_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.48.12.1587.442"},{"key":"e_1_3_4_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-017-1350-2"},{"key":"e_1_3_4_47_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2021.2017055"},{"key":"e_1_3_4_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-021-04441-1"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2023.2237120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T12:52:58Z","timestamp":1710161578000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2023.2237120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,23]]},"references-count":47,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,4,17]]}},"alternative-id":["10.1080\/00207543.2023.2237120"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2023.2237120","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"type":"print","value":"0020-7543"},{"type":"electronic","value":"1366-588X"}],"subject":[],"published":{"date-parts":[[2023,7,23]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-11-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-07","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}