{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:42:08Z","timestamp":1743068528826,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319203270"},{"type":"electronic","value":"9783319203287"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20328-7_10","type":"book-chapter","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T14:47:36Z","timestamp":1443710856000},"page":"157-170","source":"Crossref","is-referenced-by-count":0,"title":["A Column Generation Approach to the Discrete Lot Sizing and Scheduling Problem on Parallel Machines"],"prefix":"10.1007","author":[{"given":"Ant\u00f3nio J. S. T.","family":"Duarte","sequence":"first","affiliation":[]},{"given":"J. M. V. Val\u00e9rio","family":"de Carvalho","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10472-013-9339-9","volume":"69","author":"M. Caserta","year":"2013","unstructured":"Caserta, M., Vo\u00df, S.: A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing. Ann. Math. Artif. Intell. 69(2), 207\u2013224 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/mnsc.39.4.477","volume":"39","author":"D. Cattrysse","year":"1993","unstructured":"Cattrysse, D., Salomon, M., Kuik, R., van Wassenhove, L.N.: A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times. Manag. Sci. 39(4), 477\u2013486 (1993)","journal-title":"Manag. Sci."},{"issue":"5","key":"10_CR3","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/opre.1070.0404","volume":"55","author":"Z. Degraeve","year":"2007","unstructured":"Degraeve, Z., Jans, R.: A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 55(5), 909\u2013920 (2007)","journal-title":"Oper. Res."},{"issue":"9","key":"10_CR4","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1080\/00207543.2010.532927","volume":"49","author":"C. Gicquel","year":"2011","unstructured":"Gicquel, C., Minoux, M., Dallery, Y.: Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources. Int. J. Prod. Res. 49(9), 2587\u20132603 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s11590-011-0280-8","volume":"6","author":"C. Gicquel","year":"2012","unstructured":"Gicquel, C., Wolsey, L.A., Minoux, M.: On discrete lot-sizing and scheduling on identical parallel machines. Optim. Lett. 6(3), 545\u2013557 (2012)","journal-title":"Optim. Lett."},{"issue":"5","key":"10_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B. Karimi","year":"2003","unstructured":"Karimi, B., Fatemi Ghomi, S.M.T., Wilson, J.M.: The capacitated lot sizing problem: a review of models and algorithms. Omega 31(5), 365\u2013378 (2003)","journal-title":"Omega"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/opre.19.4.946","volume":"19","author":"L.S. Lasdon","year":"1971","unstructured":"Lasdon, L.S., Terjung, R.C.: An efficient algorithm for multi-item scheduling. Oper. Res. 19(4), 946\u2013969 (1971)","journal-title":"Oper. Res."},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/mnsc.4.2.115","volume":"4","author":"A.S. Manne","year":"1958","unstructured":"Manne, A.S.: Programming of economic lot sizes. Manag. Sci. 4(2):115\u2013135 (1958)","journal-title":"Manag. Sci."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0167-6377(96)00043-0","volume":"20","author":"C.A. van Eijl","year":"1997","unstructured":"van Eijl, C.A., van Hoesel, C.P.M.: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. Oper. Res. Lett. 20(1), 7\u201313 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/0377-2217(94)90079-5","volume":"75","author":"S. van Hoesel","year":"1994","unstructured":"van Hoesel, S., Kolen, A.: A linear description of the discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 75(2), 342\u2013353 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0377-2217(91)90166-S","volume":"52","author":"S. van Hoesel","year":"1991","unstructured":"van Hoesel, S., Wagelmans, A., Kolen, A.: A dual algorithm for the economic lot-sizing problem. Eur. J. Oper. Res. 52(3), 315\u2013325 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H.M. Wagner","year":"1958","unstructured":"Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manag. Sci. 5(1), 89\u201396 (1958)","journal-title":"Manag. Sci."},{"issue":"7","key":"10_CR13","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"W.I. Zangwill","year":"1968","unstructured":"Zangwill, W.I.: Minimum concave cost flows in certain networks. Manag. Sci. 14(7), 429\u2013450 (1968)","journal-title":"Manag. Sci."}],"container-title":["CIM Series in Mathematical Sciences","Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20328-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:30:48Z","timestamp":1676971848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20328-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319203270","9783319203287"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20328-7_10","relation":{},"ISSN":["2364-950X","2364-9518"],"issn-type":[{"type":"print","value":"2364-950X"},{"type":"electronic","value":"2364-9518"}],"subject":[],"published":{"date-parts":[[2015]]}}}