{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T04:02:11Z","timestamp":1776225731526,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10479-005-3970-8","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T12:12:53Z","timestamp":1133007173000},"page":"163-188","source":"Crossref","is-referenced-by-count":46,"title":["On a Fix-and-Relax Framework for a Class of Project Scheduling Problems"],"prefix":"10.1007","volume":"140","author":[{"given":"Laureano F.","family":"Escudero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Salmeron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3970_CR1","doi-asserted-by":"crossref","unstructured":"Akker, J.M. van den, C.A.J. Hurkens, and M.W.P. Savelsbergh. (2000). \u201cTime-indexed Formulations for Machine Scheduling Problems: Column Generation.\u201d INFORMS Journal on Computing 12, 111\u2013124.","DOI":"10.1287\/ijoc.12.2.111.11896"},{"key":"3970_CR2","unstructured":"Alonso-Ayuso, A., M.F. Clement, L.F. Escudero, M.L. Gil, and M.T. Ortu\u00f1o. (2003). \u201cFRC-S3, on Dealing with the Uncertainty for Stochastic Sequencing and Scheduling Problem Solving.\u201d Report I-2003-10, Centro de Investigaci\u00f3n-Operativa, Universidad Miguel Hern\u00e1ndez, Elche, Spain."},{"key":"3970_CR3","doi-asserted-by":"crossref","unstructured":"Appleget, J.A. and R.K. Wood. (2000). \u201cExplicit-Branching Constraints for Solving Mixed-Integer Programs.\u201d In M. Laguna and J.L. Gonzalez Velarde (eds.), Computing tools for Optimization and Simulation Kluwer Academic Publishers pp. 245\u2013261.","DOI":"10.1007\/978-1-4615-4567-5_14"},{"key":"3970_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E. Balas","year":"1980","unstructured":"Balas, E. and R. Martin. (1980). \u201cPivot and Complement\u2014A Heuristic for 0-1 Programming.\u201d Management Sciences 26, 86\u201396.","journal-title":"Management Sciences"},{"key":"3970_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.49.2.207.13535","volume":"49","author":"E. Balas","year":"2000","unstructured":"Balas, E., S. Ceria, M. Dawende, F. Margot, and G. Pataki. (2000). \u201cOCTANE: A New Heuristic for 0-1 Programs.\u201d Operations Research 49, 207\u2013225.","journal-title":"Operations Research"},{"key":"3970_CR6","doi-asserted-by":"crossref","unstructured":"Baptiste, Ph,. C. Le Pape, and W. Nuijten. (2001). Constraint-Based Scheduling Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"3970_CR7","first-page":"353","volume":"75","author":"M. Constantino","year":"1996","unstructured":"Constantino, M. (1996). \u201cA Cutting Plane Approach to Capacitated lot Sizing with Set-up Costs.\u201d Mathematical Programming 75, 353\u2013376.","journal-title":"Mathematical Programming"},{"key":"3970_CR8","unstructured":"Dash Optimization, Inc. (1999). Xpress-MP User Manual, http:\/\/www.dash.co.uk\/."},{"key":"3970_CR9","unstructured":"Dash Optimization, Inc. (2000). Xpress-MP Optimizer Subroutine Library, http:\/\/www.dash.co.uk\/."},{"key":"3970_CR10","unstructured":"Digital Equipment Corporation (1998). Digital Visula Fortran, Professional Edition 6.0.0, http:\/\/www.compaq.com.fortran\/."},{"key":"3970_CR11","doi-asserted-by":"crossref","unstructured":"Dillenberger, Ch., L.F. Escudero, A. Wollensak, and W. Zhang. (1994). \u201cOn Practical Resource Allocation for Production Planning and Scheduling with Period Overlapping Setups.\u201d European Journal of Operational Research 75, 275\u2013286.","DOI":"10.1016\/0377-2217(94)90074-4"},{"key":"3970_CR12","unstructured":"Escudero, L.F. (1981). \u201cOn Energy Generators Maintenance Scheduling Constrained by the Hourly Distribution of the Weekly Energy Demand.\u201d Report G320-3420 IBM Scientific Center, Palo Alto, California."},{"key":"3970_CR13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/0377-2217(82)90034-0","volume":"9","author":"L.F. Escudero","year":"1982","unstructured":"Escudero, L.F. (1982). \u201cOn Maintenance Scheduling of Production Units.\u201d European Journal of Operational Research 9, 264\u2013274.","journal-title":"European Journal of Operational Research"},{"key":"3970_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01589396","volume":"42","author":"L.F. Escudero","year":"1988","unstructured":"Escudero, L.F. (1988). \u201cS3 sets. An Extension of the Beale-Tomlin Special Ordered Sets.\u201d Mathematical Programming 42, 113\u2013123.","journal-title":"Mathematical Programming"},{"key":"3970_CR15","unstructured":"Escudero, L.F., E. G\u00f3mez, and J. Salmer\u00f3n. (1997). \u201cSISPIR: An integrated system for investment selection and scheduling in a distribution network,\u201d In Proceedings of the European Power Delivery 97 Conference Programming models pp. 122\u2013134."},{"key":"3970_CR16","first-page":"1","volume":"2","author":"K. Kularajan","year":"2000","unstructured":"Kularajan, K., G. Mitra, F. Ellison, and B. Nygreen. (2000). \u201cConstraint Classification, Preprocessing and a Branch and Relax Approach to Solving Mixed Integer Programming Models.\u201d International Journal of Mathematical Algorithms 2, 1\u201345.","journal-title":"International Journal of Mathematical Algorithms"},{"key":"3970_CR17","doi-asserted-by":"crossref","unstructured":"Klein, R. (2000). Scheduling of Resource Constrained Projects. Kluwer Academic Publishers, pp. 73\u2013109.","DOI":"10.1007\/978-1-4615-4629-0_3"},{"key":"3970_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J. Linderoth","year":"1999","unstructured":"Linderoth, J. and M.W.P. Savelsbergh. (1999). \u201cSearch Strategies for Mixed Integer Programming.\u201d INFORMS Journal on Computing 11, 173\u2013187.","journal-title":"INFORMS Journal on Computing"},{"key":"3970_CR19","doi-asserted-by":"crossref","unstructured":"Miller, A.J., G.L. Nemhauser, and M.W.P. Savelsbergh. (2003). \u201cA Multi-Item Production Planning Model with Setup Times: Algorithms, Reformulations, and Polyhedral Characterizations for a Special Case.\u201d Mathematical Programming Series B 95, 71\u201390.","DOI":"10.1007\/s10107-002-0340-z"},{"key":"3970_CR20","first-page":"353","volume":"54","author":"J. Sousa","year":"1992","unstructured":"Sousa, J. and L.A. Wolsey. (1992). \u201cA Time Indexed Formulation of Non-Preemtive Single Machine Scheduling Problems.\u201d European Journal of Operational Research 54, 353\u2013357.","journal-title":"European Journal of Operational Research"},{"key":"3970_CR21","unstructured":"Pinedo, M. (1995). Scheduling Theory, Algorithms and Systems Prentice-Hall."},{"key":"3970_CR22","doi-asserted-by":"crossref","unstructured":"Waterer, H., E.L. Johnson, P. Nobili, and M.W.P. Savelsbergh. (2002), \u201cThe Relation of Time Indexed Formulations of Single Machine Scheduling Problems to the Node Packing Problem.\u201d Mathematical Programming Series A 93, 477\u2013494.","DOI":"10.1007\/s10107-002-0335-9"},{"key":"3970_CR23","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","volume":"25","author":"L.A. Wolsey","year":"1990","unstructured":"Wolsey, L.A. (1990). \u201cValid Inequalities for Mixed Integer Programs with Generalized and Variable Upper Bounds.\u201d Discrete Applied Mathematics 25, 251\u2013261.","journal-title":"Discrete Applied Mathematics"},{"key":"3970_CR24","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0377-2217(97)89646-4","volume":"99","author":"L.A. Wolsey","year":"1997","unstructured":"Wolsey, L.A. (1997). \u201cMIP Modeling of Changeovers in Production Planning and Scheduling Problems.\u201d European Journal of Operational Research 99, 154\u2013165.","journal-title":"European Journal of Operational Research"},{"key":"3970_CR25","doi-asserted-by":"crossref","first-page":"1587","DOI":"10.1287\/mnsc.48.12.1587.442","volume":"48","author":"L.A. Wolsey","year":"2002","unstructured":"Wolsey, L.A. (2002). \u201cSolving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation.\u201d Management Science 48, 1587\u20131602.","journal-title":"Management Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3970-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3970-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3970-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T06:12:14Z","timestamp":1586585534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3970-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3970"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3970-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}