{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T16:49:26Z","timestamp":1767890966848,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T00:00:00Z","timestamp":1347408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10951-012-0286-9","type":"journal-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T02:47:29Z","timestamp":1347418049000},"page":"585-604","source":"Crossref","is-referenced-by-count":14,"title":["Solving the electricity production planning problem by a column generation based heuristic"],"prefix":"10.1007","volume":"16","author":[{"given":"Antoine","family":"Rozenknop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Wolfler Calvo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Alfandari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Chemla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"L\u00e9tocart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,12]]},"reference":[{"key":"286_CR1","doi-asserted-by":"crossref","unstructured":"Baldacci, R., Christophides, N., & Mingozzi, A. (2008). An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming, 351\u2013385.","DOI":"10.1007\/s10107-007-0178-5"},{"key":"286_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1996","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1996). Branch-and-price: column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"key":"286_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/b135457","volume-title":"GERAD. Column generation","author":"G. Desaulniers","year":"2005","unstructured":"Desaulniers, G., Desrosiers, J., & Solomon, M. M. (2005). GERAD. Column generation. Berlin: Springer."},{"issue":"1","key":"286_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10107-005-0593-4","volume":"104","author":"L. Dubost","year":"2005","unstructured":"Dubost, L., Gonzalez, R., & Lemar\u00e9chal, C. (2005). A primal-proximal heuristic applied to the French unit-commitment problem. Mathematical Programming, 104(1), 129\u2013151.","journal-title":"Mathematical Programming"},{"key":"286_CR5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1590\/S0101-82052005000300001","volume":"24","author":"E. C. Finardi","year":"2005","unstructured":"Finardi, E. C., da Silva, E. L., & Sagastiz\u00e0bal, C. (2005). Solving the unit commitment problem of hydropower plants via Lagrangian relaxation and sequential quadratic programming. Computational and Applied Mathematics, 24, 317\u2013342.","journal-title":"Computational and Applied Mathematics"},{"issue":"5","key":"286_CR6","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.ijepes.2007.10.003","volume":"30","author":"A. Frangioni","year":"2008","unstructured":"Frangioni, A., Gentile, C., & Lacalandra, F. (2008). Solving unit commitment problems with general ramp constraints. International Journal of Electrical Power & Energy Systems, 30(5), 316\u2013326.","journal-title":"International Journal of Electrical Power & Energy Systems"},{"key":"286_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88965-6","volume-title":"Optimization in the energy industry","author":"J. Kallrath","year":"2009","unstructured":"Kallrath, J., Pardalos, P. M., Rebennack, S., & Scheidt, M. (2009). Optimization in the energy industry."},{"key":"286_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/59.485989","volume":"11","author":"S. A. Kazarlis","year":"1996","unstructured":"Kazarlis, S. A., Bakirtzis, A. G., & Petridis, V. (1996). A genetic algorithm approach to solve the unit commitment problem. IEEE Transactions on Power Systems, 11, 83\u201392.","journal-title":"IEEE Transactions on Power Systems"},{"key":"286_CR9","first-page":"271","volume-title":"12th international conference on principles and practice of constraint programming","author":"M. I. Khemmoudj","year":"2006","unstructured":"Khemmoudj, M. I., Porcheron, M., & Bennaceur, H. (2006). When constraints programming and local search solve the scheduling problem of edf nuclear power plant aoutages. In 12th international conference on principles and practice of constraint programming (pp. 271\u2013283)."},{"key":"286_CR10","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"November-Decemb","author":"M. E. Lubbecke","year":"2005","unstructured":"Lubbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, November-December, 1007\u20131023.","journal-title":"Operations Research"},{"key":"286_CR11","unstructured":"Lusby, R., Muller, L. F., & Petersen, B. (2010). A solution approach to the roadef\/euro 2010 challenge based on benders decomposition. Technical report."},{"key":"286_CR12","unstructured":"Porcheron, M., Gorge, A., Juen, O., Simovic, T., & Dereu, G. (2010). EDF R&D, Challenge roadef\/euro 2010: a large-scale energy management problem with varied constraints."},{"key":"286_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.40.1.S145","volume":"40","author":"A. Wagelmans","year":"1992","unstructured":"Wagelmans, A., van Hoesel, S., & Kolen, A. (1992). Economic lot sizing: an o(nlogn) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research, 40, 145\u2013156.","journal-title":"Operations Research"},{"key":"286_CR14","doi-asserted-by":"crossref","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. (1958). Dynamic version of the economic lot size model. Management Science, 5, 89\u201396.","journal-title":"Management Science"},{"key":"286_CR15","volume-title":"Integer programming","author":"L. A. Wolsey","year":"1998","unstructured":"Wolsey, L. A. (1998). Integer programming."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0286-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0286-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0286-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:47Z","timestamp":1559468387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0286-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,12]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0286-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,12]]}}}