{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:35Z","timestamp":1759667735405},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1016\/s0167-6377(99)00050-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"175-182","source":"Crossref","is-referenced-by-count":12,"title":["The project scheduling problem with irregular starting time costs"],"prefix":"10.1016","volume":"25","author":[{"given":"Vittorio","family":"Maniezzo","sequence":"first","affiliation":[]},{"given":"Aristide","family":"Mingozzi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00050-4_BIB1","doi-asserted-by":"crossref","unstructured":"N. Christofides, R. Alvarez-Valdes, J.M. Tamarit, Project scheduling with resource constraints: a branch and bound approach, European J. Oper. Res. 29 (1987) 262\u2013273.","DOI":"10.1016\/0377-2217(87)90240-2"},{"key":"10.1016\/S0167-6377(99)00050-4_BIB2","unstructured":"Cplex Optimization Inc., Using the CPLEX callable library and the CPLEX mixed integer library, 1994."},{"key":"10.1016\/S0167-6377(99)00050-4_BIB3","unstructured":"E. Demeulemeester, W. Herroelen, P. van Dommelen, An optimal recursive search procedure for the deterministic unconstrained max-npv project scheduling problem, Report no. 9603, Department of Applied Economics, K.U. Leuven, 1995."},{"issue":"8","key":"10.1016\/S0167-6377(99)00050-4_BIB4","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1287\/mnsc.23.8.882","article-title":"Scheduling a project to maximize its present value: a zero\u2013one programming approach","volume":"23","author":"Doersch","year":"1977","journal-title":"Manage. Sci."},{"key":"10.1016\/S0167-6377(99)00050-4_BIB5","unstructured":"S.E. Elmaghraby, Activity Networks: Project Planning and Control by Network Models, Wiley, New York, 1977."},{"key":"10.1016\/S0167-6377(99)00050-4_BIB6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0377-2217(95)00382-7","article-title":"Scheduling projects to maximize net present value \u2014 the case of time-dependent contingent cash flows","volume":"96","author":"Etgar","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(99)00050-4_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangean relaxation for solving integer programming","volume":"27","author":"Fisher","year":"1981","journal-title":"Manage. Sci."},{"issue":"1","key":"10.1016\/S0167-6377(99)00050-4_BIB8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/nav.3800190110","article-title":"The payment scheduling problem","volume":"19","author":"Grinold","year":"1972","journal-title":"Nav. Res. Logistics Quart."},{"issue":"10","key":"10.1016\/S0167-6377(99)00050-4_BIB9","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.1287\/mnsc.42.10.1395","article-title":"A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows","volume":"42","author":"Icmeli","year":"1996","journal-title":"Manage. Sci."},{"issue":"5","key":"10.1016\/S0167-6377(99)00050-4_BIB10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1287\/mnsc.16.5.357","article-title":"Cash flows in networks","volume":"16","author":"Russel","year":"1970","journal-title":"Manage. Sci."},{"issue":"1","key":"10.1016\/S0167-6377(99)00050-4_BIB11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0272-6963(87)90005-2","article-title":"Maximizing the net present value of a project subject to material and capital constraints","volume":"7","author":"Smith-Daniels","year":"1987","journal-title":"J. Oper. Manage."},{"key":"10.1016\/S0167-6377(99)00050-4_BIB12","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0377-2217(93)90176-N","article-title":"Scheduling a project to maximize its net present value: an integer programming approach","volume":"64","author":"Yang","year":"1992","journal-title":"European J. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000504?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000504?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:55:25Z","timestamp":1555577725000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["S0167637799000504"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00050-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}