{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:38:16Z","timestamp":1770971896195,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":86,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428770","type":"print"},{"value":"9783540455868","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45586-8_3","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T05:06:11Z","timestamp":1180328771000},"page":"57-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Mathematical Programming Models and Formulations for Deterministic Production Planning Problems"],"prefix":"10.1007","author":[{"given":"Yves","family":"Pochet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/mnsc.30.2.222","volume":"30","author":"P. Afentakis","year":"1984","unstructured":"P. Afentakis, B. Gavish and U. Karmarkar, \u201cComputationally efficient optimal solutions to the lot-sizing problem in multistage assembly systems\u201d, Management Science 30(2), 222\u2013239, 1984.","journal-title":"Management Science"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/opre.34.2.237","volume":"34","author":"P. Afentakis","year":"1986","unstructured":"P. Afentakis and B. Gavish, \u201cOptimal lot-sizing algorithms for complexpro duct structures\u201d, Operations Research 34, 237\u2013249, 1986.","journal-title":"Operations Research"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1287\/opre.41.3.549","volume":"41","author":"A. Aggarwal","year":"1993","unstructured":"A. Aggarwal and J. Park, \u201cImproved algorithms for economic lot-size problems\u201d, Operations Research 41, 549\u2013571, 1993.","journal-title":"Operations Research"},{"issue":"2","key":"3_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0167-6377(99)00030-9","volume":"25","author":"A. Agra","year":"1999","unstructured":"A. Agra and M. Constantino, \u201cLotsizing with backlogging and start-ups: the case ofWagner-Whitin costs\u201d, Operations Research Letters 25 (2), 81\u201388, 1999.","journal-title":"Operations Research Letters"},{"key":"3_CR5","volume-title":"Planning and control systems: a framework for analysis","author":"R.N. Anthony","year":"1965","unstructured":"R.N. Anthony, \u201cPlanning and control systems: a framework for analysis\u201d, Harvard University Press, Cambridge, Mass., 1965."},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0121006","volume":"22","author":"I. Barany","year":"1984","unstructured":"I. Barany, T.J. Van Roy and L.A. Wolsey, \u201cUncapacitated lot sizing: the convex hull of solutions\u201d, Mathematical Programming Study 22, 32\u201343, 1984.","journal-title":"Mathematical Programming Study"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","volume":"30","author":"I. Barany","year":"1984","unstructured":"I. Barany, T.J. Van Roy and L.A. Wolsey, \u201cStrong formulations for multi-item capacitated lot-sizing\u201d, Management Science 30, 1255\u20131261, 1984.","journal-title":"Management Science"},{"issue":"2","key":"3_CR8","first-page":"55","volume":"34","author":"C. Batta","year":"1994","unstructured":"C. Batta and J. Teghem, \u201cOptimization of production scheduling in plastics processing industry\u201d, Jorbel (Belgian Journal of operations research, statistics and computer science) 34 (2), 55\u201378, 1994.","journal-title":"Jorbel (Belgian Journal of operations research, statistics and computer science)"},{"issue":"10","key":"3_CR9","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1287\/mnsc.29.10.1126","volume":"29","author":"P.J. Billington","year":"1983","unstructured":"P.J. Billington, J.O. McClain, L.J. Thomas, \u201c\u00e1Mathematical Programming approaches to capacity constrained MRP systems\u00e1: review, formulation and problem reduction\u00e1\u201d, Management Science 29 (10), 1126\u20131141, 1983.","journal-title":"Management Science"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02248584","volume":"26","author":"W.-H. Chen","year":"1990","unstructured":"W.-H. Chen and J.-M. Thizy, \u201cAnalysis of relaxations for the multi-item capacitated lot-sizing problem\u201d, Annals of Operations Research 26, 29\u201372, 1990.","journal-title":"Annals of Operations Research"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/mnsc.6.4.475","volume":"6","author":"A.J. Clark","year":"1960","unstructured":"A.J. Clark and H. Scarf, \u201cOptimal policies for multi echelon inventory problems\u201d Management Science 6, 475\u2013490, 1960.","journal-title":"Management Science"},{"issue":"3","key":"3_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02592189","volume":"75","author":"M. Constantino","year":"1996","unstructured":"M. Constantino, \u201cA cutting plane approach to capacitated lot-sizing with startup costs\u201d, Mathematical Programming 75 (3), 353\u2013376, 1996.","journal-title":"Mathematical Programming"},{"issue":"1","key":"3_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/moor.23.1.101","volume":"23","author":"M. Constantino","year":"1998","unstructured":"M. Constantino, \u201cLower bounds in lot-sizing models: A polyhedral study\u201d, Mathematics of Operations Research 23 (1), 101\u2013118, 1998.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"3_CR14","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/mnsc.20.1.14","volume":"20","author":"W.B. Crowston","year":"1973","unstructured":"W.B. Crowston, M.H. Wagner, \u201cDynamic lot size models for multi stage assembly systems\u201d, Management Science 20(1), 14\u201321, 1973.","journal-title":"Management Science"},{"issue":"5","key":"3_CR15","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/mnsc.19.5.517","volume":"19","author":"W.B. Crowston","year":"1973","unstructured":"W.B. Crowston, M.H. Wagner, J.F. Williams, \u201cEconomic lot size determination in multi stage assembly systems\u201d, Management Science 19(5), 517\u2013527, 1973.","journal-title":"Management Science"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(97)00383-4","volume":"112","author":"Z. Degraeve","year":"1999","unstructured":"Z. Degraeve, F. Roodhooft, \u201cImproving the efficiency of the purchasing process using total cost of ownership information\u00e1: The case of heating electrodes at Cockerill-Sambre S.A.\u00e1\u201d, European Journal of Operational Research 112, 42\u201353, 1999.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"3_CR17","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1287\/mnsc.38.9.1329","volume":"38","author":"M. Diaby","year":"1992","unstructured":"M. Diaby, H.C. Bahl, M.H. Karwan and S. Zionts, \u201cA Lagrangean relaxation approach to very large scale capacitated lot-sizing\u201d, Management Science 38(9), 1329\u20131340, 1992.","journal-title":"Management Science"},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/mnsc.24.6.587","volume":"24","author":"S.E. Elmaghraby","year":"1978","unstructured":"S.E. Elmaghraby, \u201cThe economic lot-scheduling problem (ELSP): reviews and extensions\u201d, Management Science 24, 587\u2013598, 1978.","journal-title":"Management Science"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"G.D. Eppen","year":"1987","unstructured":"G.D. Eppen and R.K. Martin, Solving multi-item lot-sizing problems using variable definition, Operations Research 35, 832\u2013848, 1987.","journal-title":"Operations Research"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.37.8.909","volume":"37","author":"A. Federgrun","year":"1991","unstructured":"A. Federgrun and M. Tsur, \u201cA simple forward algorithm to solve general dynamic lot-size models with n periods in O(nlogn) or O(n) time\u201d, Management Science 37, 909\u2013925, 1991.","journal-title":"Management Science"},{"issue":"3","key":"3_CR21","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0377-2217(90)90245-7","volume":"44","author":"B. Fleischmann","year":"1990","unstructured":"B. Fleischmann, \u201cThe discrete lotsizing and scheduling problem\u201d, European Journal of Operational Research 44(3), 337\u2013348, 1990.","journal-title":"European Journal of Operational Research"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"B. Fleischmann, \u201cThe discrete lotsizing and scheduling problem with sequencedependent setup costs\u201d, European Journal of Operational Research, 1994.","DOI":"10.1016\/0377-2217(94)90083-3"},{"key":"3_CR23","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/mnsc.18.1.12","volume":"18","author":"M. Florian","year":"1971","unstructured":"M. Florian and M. Klein, \u201cDeterministic production planning with concave costs and capacity constraints\u201d, Management Science 18, 12\u201320, 1971.","journal-title":"Management Science"},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-6377(89)90016-3","volume":"8","author":"M.X. Goemans","year":"1989","unstructured":"M.X. Goemans, \u201cValid inequalities and separation for mixed 0-1 constraints with variable upper bounds\u201d, Operations Research Letters 8, 315\u2013322, 1989.","journal-title":"Operations Research Letters"},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Grotschel","year":"1981","unstructured":"M. Grotschel, L. Lovasz and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization\u201d, Combinatorica 1, 169\u2013197, 1981.","journal-title":"Combinatorica"},{"key":"3_CR26","volume-title":"Mixing mixed integer rounding inequalities","author":"O. Gunluk","year":"1998","unstructured":"O. Gunluk and Y. Pochet, \u201cMixing mixed integer rounding inequalities\u201d, CORE discussion paper 9811, Universit\u00e9 catholique de Louvain, Belgium, 1998. (to appear in Mathematical Programming)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Haase, \u201cLotsizing and scheduling for production planning\u201d, Lecture notes in economics and mathematical systems 408, Springer, Berlin, 1994.","DOI":"10.1007\/978-3-642-45735-7"},{"key":"3_CR28","unstructured":"F.W. Harris, \u201cHow many parts to make at once\u201d, Factory, the Magazine of Management 10(2), 1913."},{"key":"3_CR29","volume-title":"TIMS studies in Management Science","author":"A.C. Haxand","year":"1975","unstructured":"A.C. Haxand H.C. Meal, \u201cHierarchical integration of production planning and scheduling\u201d, in M. Geisler editor, TIMS studies in Management Science, chapter 1, North Holland\/American Elsevier, New York, 1975."},{"key":"3_CR30","unstructured":"S. Kang, K. Malik, L.J. Thomas, \u201cLotsizing and scheduling in parallel machines with sequence dependent setup costs\u201d,Working paper 97\u201307, Johnson Graduate school of Management, Cornell university, 1997."},{"key":"3_CR31","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1287\/opre.33.2.326","volume":"33","author":"U.S. Karmarkar","year":"1985","unstructured":"U.S. Karmarkar and L. Schrage, \u201cThe deterministic dynamic product cycling problem\u201d, Operations Research 33, 326\u2013345, 1985.","journal-title":"Operations Research"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"A. Kimms, \u201cMulti-level lot sizing and scheduling: methods for capacitated, dynamic and deterministic models\u201d, Physica-Verlag (production and logistics series), Heidelberg, 1997.","DOI":"10.1007\/978-3-642-50162-3"},{"key":"3_CR33","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0098-1354(93)80015-F","volume":"17","author":"E. Kondili","year":"1993","unstructured":"E. Kondili, C.C. Pantelides, R.W.H. Sargent, \u201cA general algorithm for shortterm scheduling of batch operations-1. MILP formulation\u201d, Computers Chemical Engineering 17, 211\u2013227, 1993.","journal-title":"Computers Chemical Engineering"},{"key":"3_CR34","first-page":"155","volume-title":"Optimierung bei Graphentheoretischen und Ganzzahligen Probleme","author":"J. Krarup","year":"1977","unstructured":"J. Krarup and O. Bilde, \u201cPlant location, set covering and economic lot sizes: an O(mn) algorithm for structured problems\u201d, in \u201cOptimierung bei Graphentheoretischen und Ganzzahligen Probleme\u201d, L. Collatz et al. eds, Birkhauser Verlag, Basel, 155\u2013180, 1977."},{"key":"3_CR35","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0377-2217(94)90072-8","volume":"75","author":"R. Kuik","year":"1994","unstructured":"R. Kuik, M. Salomon and L.N. van Wassenhove, \u201cBatching decisions: structure and models\u201d, European Journal of Operational Research 75, 243\u2013263, 1994.","journal-title":"European Journal of Operational Research"},{"key":"3_CR36","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/opre.19.4.946","volume":"19","author":"L.S. Lasdon","year":"1971","unstructured":"L.S. Lasdon and R.C. Terjung, \u201cAn efficient algorithm for multi-item scheduling\u201d, Operations Research 19, 946\u2013969, 1971.","journal-title":"Operations Research"},{"key":"3_CR37","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01589110","volume":"45","author":"J. Leung","year":"1989","unstructured":"J. Leung, T.M. Magnanti and R. Vachani, \u201cFacets and algorithms for capacitated lot-sizing\u201d, Mathematical Programming 45, 331\u2013359, 1989.","journal-title":"Mathematical Programming"},{"issue":"3","key":"3_CR38","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/PL00011411","volume":"89","author":"M. Loparic","year":"2001","unstructured":"M. Loparic, Y. Pochet and L.A. Wolsey, \u201cUncapacitated lot-sizing with sales and safety stocks\u201d, Mathematical Programming 89 (3), 487\u2013504, 2001.","journal-title":"Mathematical Programming"},{"key":"3_CR39","unstructured":"M. Loparic, H. Marchand and L.A. Wolsey, \u201cDynamic knapsack sets and capacitated lot-sizing\u201d, CORE discussion paper 2000\/47, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium, 2000."},{"key":"3_CR40","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0167-5060(08)70822-7","volume":"4","author":"L. Lovasz","year":"1979","unstructured":"L. Lovasz, \u201cGraph theory and integer programming\u201d, Annals of Discrete Mathematics 4, 141\u2013158, 1979.","journal-title":"Annals of Discrete Mathematics"},{"issue":"5","key":"3_CR41","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1287\/mnsc.18.5.327","volume":"18","author":"S.F. Love","year":"1972","unstructured":"S.F. Love, \u201cA facilities in series inventory model with nested schedules\u201d, Management Science 18(5), 327\u2013338, 1972.","journal-title":"Management Science"},{"key":"3_CR42","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.38.3.456","volume":"38","author":"T.M. Magnanti","year":"1990","unstructured":"T.M. Magnanti and R. Vachani, \u201cA strong cutting plane algorithm for production scheduling with changeover costs\u201d, Operations Research 38, 456\u2013473, 1990.","journal-title":"Operations Research"},{"key":"3_CR43","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"H. Marchand and L.A. Wolsey, \u201cThe 0-1 knapsack problem with a single continuous variable\u201d, Mathematical Programming 85, 15\u201333, 1999.","journal-title":"Mathematical Programming"},{"key":"3_CR44","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.35.6.820","volume":"35","author":"R.K. Martin","year":"1987","unstructured":"R.K. Martin, \u201cGenerating alternative mixed-integer programming models using variable redefinition\u201d, Operations Research 35, 331\u2013359, 1987.","journal-title":"Operations Research"},{"key":"3_CR45","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"R.K. Martin","year":"1991","unstructured":"R.K. Martin, \u201cUsing separation algorithms to generate mixed integer model reformulations\u201d, Operations Research Letters 10, 119\u2013128, 1991.","journal-title":"Operations Research Letters"},{"key":"3_CR46","unstructured":"A.J. Miller, G.L. Nemhauser and M.W.P. Savelsbergh, \u201cOn the polyhedral structure of a multi-item production planning model with setup times\u201d, CORE discussion paper 2000\/52, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium, 2000."},{"key":"3_CR47","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, \u201cInteger and combinatorial optimization\u201d, Wiley, New York, 1988."},{"key":"3_CR48","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"G.L. Nemhauser and L.A. Wolsey, \u201cA recursive procedure for generating all cuts for 0-1 mixed integer programs\u201d, Mathematical Programming 46, 379\u2013390, 1990.","journal-title":"Mathematical Programming"},{"key":"3_CR49","volume-title":"Material Requirements planning","author":"J. Orlicky","year":"1975","unstructured":"J. Orlicky, \u201cMaterial Requirements planning\u201d, McGraw-Hill, New York, 1975."},{"key":"3_CR50","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"M.W. Padberg, T.J. Van Roy and L.A. Wolsey, \u201cValid inequalities for fixed charge problems\u201d, Operations Research 33, 842\u2013861, 1985.","journal-title":"Operations Research"},{"issue":"8","key":"3_CR51","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/S0098-1354(96)00318-3","volume":"21","author":"Pinto","year":"1997","unstructured":"Pinto and Grossmann, \u201cA logic-based approach to scheduling problems with resource constraints\u201d, Computers and Chemical Engineering 21 (8), 801\u2013818, 1997.","journal-title":"Computers and Chemical Engineering"},{"key":"3_CR52","unstructured":"Y. Pochet, \u201cLot-sizing problems: reformulations and cutting plane algorithms\u201d, PhD Thesis, Universit\u00e9 Catholique de Louvain, Belgium, 1987."},{"key":"3_CR53","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0167-6377(88)90076-4","volume":"7","author":"Y. Pochet","year":"1988","unstructured":"Y. Pochet, \u201cValid inequalities and separation for capacitated economic lotsizing\u201d, Operations Research Letters 7, 109\u2013116, 1988.","journal-title":"Operations Research Letters"},{"key":"3_CR54","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01580738","volume":"40","author":"Y. Pochet","year":"1988","unstructured":"Y. Pochet and L.A. Wolsey, \u201cLot-size models with backlogging: Strong formulations and cutting planes\u201d, Mathematical Programming 40, 317\u2013335, 1988.","journal-title":"Mathematical Programming"},{"key":"3_CR55","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/mnsc.37.1.53","volume":"37","author":"Y. Pochet","year":"1991","unstructured":"Y. Pochet and L.A. Wolsey, \u201cSolving multi-item lot sizing problems using strong cutting planes\u201d, Management Science 37, 53\u201367, 1991.","journal-title":"Management Science"},{"key":"3_CR56","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","volume":"18","author":"Y. Pochet","year":"1993","unstructured":"Y. Pochet and L.A. Wolsey, \u201cLot-sizing with constant batches: Formulation and valid inequalities\u201d, Mathematics of Operations Research 18, 767\u2013785, 1993.","journal-title":"Mathematics of Operations Research"},{"key":"3_CR57","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01582225","volume":"67","author":"Y. Pochet","year":"1994","unstructured":"Y. Pochet and L.A. Wolsey, \u201cPolyhedra for lot-sizing with Wagner-Whitin costs\u201d, Mathematical Programming 67, 297\u2013323, 1994.","journal-title":"Mathematical Programming"},{"key":"3_CR58","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1090\/dimacs\/020\/05","volume":"20","author":"Y. Pochet","year":"1995","unstructured":"Y. Pochet and L.A. Wolsey, \u201cAlgorithms and reformulations for lot-sizing problems\u201d, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20, 245\u2013293, 1995.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"3_CR59","unstructured":"Y. Pochet, T. Tahmassebi and L.A. Wolsey, \u201cReformulation of a single stage packing model\u201d, Report, Memips: Esprit project 20118, June 1996."},{"key":"3_CR60","volume-title":"Tighter relaxations of fixed charge network flow problems","author":"R.L. Rardin","year":"1979","unstructured":"R.L. Rardin and U. Choe, \u201cTighter relaxations of fixed charge network flow problems\u201d, report J-79-18, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 1979."},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"R. Rardin and L.A. Wolsey, \u201cValid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems\u201d, European Journal of Operations Research, Nov 1993.","DOI":"10.1016\/0377-2217(93)90263-M"},{"key":"3_CR62","volume-title":"Deterministic lotsizing models for production planning","author":"M. Salomon","year":"1990","unstructured":"M. Salomon, \u201cDeterministic lotsizing models for production planning\u201d, PhD. Thesis, Erasmus Universiteit Rotterdam, The Netherlands, 1990."},{"issue":"7","key":"3_CR63","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1287\/mnsc.37.7.801","volume":"37","author":"M. Salomon","year":"1991","unstructured":"M. Salomon, L.G. Kroon, R. Kuik, L.N. Van Wassenhove, \u201cSome extensions of the discrete lotsizing and scheduling problem\u201d, Management Science 37(7), 801\u2013812, 1991.","journal-title":"Management Science"},{"key":"3_CR64","unstructured":"N.C. Simpson, S.S. Erenguc, \u201cProduction planning in multiple stage manufacturing environments with joint costs, limited resources nad set-up times\u201d, Technical report, Department of Management Science and Systems, University of Buffalo, 1998."},{"issue":"3","key":"3_CR65","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/0377-2217(95)00094-1","volume":"94","author":"H. Stadtler","year":"1996","unstructured":"H. Stadtler, \u201cMixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing\u201d, European Journal of Operational Research 94 (3), 561\u2013581, 1996.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"3_CR66","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","volume":"42","author":"H. Tempelmeier","year":"1996","unstructured":"H. Tempelmeier and M. Derstro., \u201cA Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times\u201d, Management Science 42 (5), 738\u2013757, 1996.","journal-title":"Management Science"},{"issue":"4","key":"3_CR67","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1080\/07408178508975308","volume":"17","author":"J.M. Thizy","year":"1985","unstructured":"J.M. Thizy and L.N. Van Wassenhove \u201cLagrangean relaxation for the multiitem capacitated lot-sizing problem: a heuristic implementation\u201d, IIE Transactions 17 (4), 308\u2013313, 1985.","journal-title":"IIE Transactions"},{"issue":"3","key":"3_CR68","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","volume":"35","author":"W. Trigeiro","year":"1989","unstructured":"W. Trigeiro, L.J. Thomas and J.O. McClain, \u201cCapacitated lot sizing with setup times\u201d, Management Science 35(3), 353\u2013366, 1989.","journal-title":"Management Science"},{"issue":"10","key":"3_CR69","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1287\/mnsc.44.10.1409","volume":"44","author":"F. Vanderbeck","year":"1998","unstructured":"F. Vanderbeck, \u201cLot-sizing with start up times\u201d, Management Science 44 (10), 1409\u20131425, 1998.","journal-title":"Management Science"},{"key":"3_CR70","unstructured":"W. Van de Velde, Private communication, 1997."},{"key":"3_CR71","unstructured":"C.P.M. van Hoesel, \u201cModels and algorithms for single-item lot sizing problems\u201d, Ph.D. Thesis, Erasmus Universiteit, Rotterdam, 1991."},{"key":"3_CR72","unstructured":"S. van Hoesel, A. Wagelmans and L.A. Wolsey, \u201cEconomic lot-sizing with startup costs: the convex hull\u201d, SIAM Journal of Discrete Mathematics, 1994."},{"issue":"1","key":"3_CR73","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/mnsc.42.1.142","volume":"42","author":"S. Hoesel van","year":"1996","unstructured":"S. van Hoesel and A. Wagelmans, \u201cAn O(T-3) algorithm for the economic lotsizing problem with constant capacities\u201d, Management Science 42 (1), 142\u2013150, 1996.","journal-title":"Management Science"},{"key":"3_CR74","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(85)90012-4","volume":"4","author":"T.J. Roy Van","year":"1985","unstructured":"T.J. Van Roy and L.A. Wolsey, \u201cValid inequalities and separation for uncapacitated fixed charge networks\u201d, Operations Research Letters 4, 105\u2013112, 1985.","journal-title":"Operations Research Letters"},{"issue":"2","key":"3_CR75","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/opre.17.2.262","volume":"17","author":"A.F. Veinott","year":"1969","unstructured":"A.F. Veinott, \u201cMinimum concave cost solution of Leontief substitution models of multi-facility inventory systems\u201d, Operations Research 17(2), 262\u2013291, 1969.","journal-title":"Operations Research"},{"key":"3_CR76","unstructured":"T.E. Vollman, W.L. Berry, and D.C. Whybark, \u201cManufacturing Planning and Control Systems\u201d, Third Edition, Richard D. Irwin., 1997."},{"key":"3_CR77","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.40.1.S145","volume":"40","author":"A.P.M. Wagelmans","year":"1992","unstructured":"A.P.M. Wagelmans, C.P.M. van Hoesel and A.W.J. Kolen, \u201cEconomic lotsizing: an O(nlogn) algorithm that runs in linear time in the Wagner-Whitin case\u201d, Operations Research 40, Supplement 1, 145\u2013156, 1992.","journal-title":"Operations Research"},{"key":"3_CR78","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H.M. Wagner","year":"1958","unstructured":"H.M. Wagner and T.M. Whitin, \u201cDynamic version of the economic lot size model\u201d, Management Science 5, 89\u201396, 1958.","journal-title":"Management Science"},{"key":"3_CR79","unstructured":"H. Westenberger and J. Kallrath, \u201cFormulation of a jobshop problem in process industry\u201d, Preprint, Bayer, Leverkusen, January 1995."},{"key":"3_CR80","unstructured":"R.H. Wilson, \u201cA scientific routine for stock control\u201d, Harvard Business Review 13, 1934."},{"key":"3_CR81","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.37.5.741","volume":"37","author":"L.A. Wolsey","year":"1989","unstructured":"L.A. Wolsey, \u201cUncapacitated lot-sizing problems with start-up costs\u201d, Operations Research 37, 741\u2013747, 1989.","journal-title":"Operations Research"},{"key":"3_CR82","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0377-2217(97)89646-4","volume":"99","author":"L.A. Wolsey","year":"1997","unstructured":"L.A. Wolsey, \u201cMIP modelling of changeovers in production planning and scheduling problems\u201d, European Journal of Operational Research 99, 154\u2013165, 1997.","journal-title":"European Journal of Operational Research"},{"key":"3_CR83","volume-title":"Integer programming","author":"L.A. Wolsey","year":"1999","unstructured":"L.A. Wolsey, \u201cInteger programming\u201d, Wiley, New York, 1999."},{"key":"3_CR84","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"W.I. Zangwill","year":"1968","unstructured":"W.I. Zangwill, \u201cMinimum concave cost flows in certain networks\u201d, Management Science 14, 429\u2013450, 1968.","journal-title":"Management Science"},{"issue":"9","key":"3_CR85","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1287\/mnsc.15.9.506","volume":"15","author":"W.I. Zangwill","year":"1969","unstructured":"W.I. Zangwill, \u201cA backlogging model and a multi-echelon model of a dynamic economic lot size production system-a network approach\u201d, Management Science 15(9), 506\u2013527, 1969.","journal-title":"Management Science"},{"key":"3_CR86","unstructured":"X. Zhang and R.W.H. Sargent, \u201cA new unified formulation for process scheduling\u201d, AIChE annual meeting, Paper 144c, St Louis, Missouri, 1993."}],"container-title":["Lecture Notes in Computer Science","Computational Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45586-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T15:38:39Z","timestamp":1707925119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45586-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428770","9783540455868"],"references-count":86,"URL":"https:\/\/doi.org\/10.1007\/3-540-45586-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}