{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:24:13Z","timestamp":1759991053186},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,3,13]],"date-time":"2012-03-13T00:00:00Z","timestamp":1331596800000},"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":[[2014,2]]},"DOI":"10.1007\/s10479-012-1106-5","type":"journal-article","created":{"date-parts":[[2012,3,12]],"date-time":"2012-03-12T14:50:55Z","timestamp":1331563855000},"page":"115-130","source":"Crossref","is-referenced-by-count":5,"title":["Approximability results for the resource-constrained project scheduling problem with a single type of resources"],"prefix":"10.1007","volume":"213","author":[{"given":"Evgeny R.","family":"Gafarov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Lazarev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,13]]},"reference":[{"key":"1106_CR1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.cor.2009.07.003","volume":"38","author":"L. Bianco","year":"2011","unstructured":"Bianco, L., & Caramia, M. (2011). A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations. Computers & Operations Research, 38, 14\u201320.","journal-title":"Computers & Operations Research"},{"key":"1106_CR2","volume-title":"Complex scheduling","author":"P. Brucker","year":"2006","unstructured":"Brucker, P., & Knust, S. (2006). Complex scheduling. Berlin, Heidelberg: Springer."},{"key":"1106_CR3","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Knust, S., Schoo, A., & Thiele, O. (1998). A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 107, 272\u2013288.","journal-title":"European Journal of Operational Research"},{"key":"1106_CR4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/S0377-2217(02)00763-4","volume":"149","author":"J. Carlier","year":"2003","unstructured":"Carlier, J., & Neron, E. (2003). On linear lower bounds for the resource constrained project scheduling problem. European Journal of Operational Research, 149, 314\u2013324.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"1106_CR5","first-page":"314","volume":"57","author":"T. C. E. Cheng","year":"2004","unstructured":"Cheng, T. C. E., Ng, C. T., Yuan, J. J., & Liu, Z. H. (2004). Single machine parallel batch scheduling subject to precedence constraints. Naval Research Logistics, 57(7), 314\u2013324.","journal-title":"Naval Research Logistics"},{"key":"1106_CR6","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0377-2217(95)00358-4","volume":"90","author":"E. L. Demeulemeester","year":"1996","unstructured":"Demeulemeester, E. L., & Herroelen, W. S. (1996). An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. European Journal of Operational Research, 90, 334\u2013348.","journal-title":"European Journal of Operational Research"},{"key":"1106_CR7","unstructured":"Gafarov, E. R., Lazarev, A. A., & Werner, F. (2010). On lower and upper bounds for the resource-constrained project scheduling problem. Preprint 08\/10, FMA, Otto-von-Guericke-Universit\u00e4t Magdeburg."},{"key":"1106_CR8","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S. Hartmann","year":"2000","unstructured":"Hartmann, S., & Kolisch, R. (2000). Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research, 127, 394\u2013407.","journal-title":"European Journal of Operational Research"},{"key":"1106_CR9","first-page":"147","volume-title":"Project scheduling: recent models, algorithms and applications","author":"R. Kolisch","year":"1998","unstructured":"Kolisch, R., & Hartmann, S. (1998). Heuristic algorithms for solving the resource-constrained project scheduling problem\u2014classification and computational analysis. In J. Weglarz (Ed.), Project scheduling: recent models, algorithms and applications (pp. 147\u2013178). Boston: Kluwer."},{"issue":"1","key":"1106_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R. Kolisch","year":"2006","unstructured":"Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: an update. European Journal of Operational Research, 174(1), 23\u201337.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1106_CR11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0305-0483(00)00046-3","volume":"29","author":"R. Kolisch","year":"2001","unstructured":"Kolisch, R., & Padman, R. (2001). An integrated survey of deterministic project scheduling. Omega, 29(3), 249\u2013272.","journal-title":"Omega"},{"key":"1106_CR12","unstructured":"Kolisch, R., & Sprecher, A. (1996). PSPLIB\u2014a\u00a0project scheduling problem library. Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre, No.\u00a0396. Kiel, Germany."},{"key":"1106_CR13","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy, Kan A. H. G., & Shmoys, D. B. (1989). Sequencing and scheduling: algorithms and complexity (Report BS-R8909). Centre for Mathematics and Computer Science, Amsterdam."},{"issue":"12","key":"1106_CR14","doi-asserted-by":"crossref","first-page":"2070","DOI":"10.1134\/S0005117908120060","volume":"69","author":"A. A. Lazarev","year":"2008","unstructured":"Lazarev, A. A., & Gafarov, E. R. (2008). On project scheduling problem. Automation and Remote Control, 69(12), 2070\u20132087.","journal-title":"Automation and Remote Control"},{"issue":"3","key":"1106_CR15","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S. Martello","year":"2003","unstructured":"Martello, S., Monaci, M., & Vigo, D. (2003). An exact approach to the strip-packing problem. INFORMS Journal on Computing, 15(3), 310\u2013319.","journal-title":"INFORMS Journal on Computing"},{"key":"1106_CR16","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., & Bianco, L. (1998). An exact algorithm for project scheduling with resource constraints based on new mathematical formulation. Management Science, 44, 714\u2013729.","journal-title":"Management Science"},{"key":"1106_CR17","unstructured":"Rykov, I. (2006). Approximate solving of RCPSP. Abstract Guide of OR 2006, Karlsruhe 6.9.-8.9.2006, Germany, p. 226."},{"issue":"2","key":"1106_CR18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"Steinberg, A. (1997). A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2), 401\u2013409.","journal-title":"SIAM Journal on Computing"},{"key":"1106_CR19","unstructured":"Uetz, M. (2002). Algorithms for deterministic and stochastic scheduling. Ph.D. thesis. Cuvillier Verlag."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1106-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1106-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1106-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:34Z","timestamp":1559153374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1106-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,13]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["1106"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1106-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,13]]}}}