{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:28:49Z","timestamp":1760488129001},"reference-count":21,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0305-0548(94)90014-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"841-853","source":"Crossref","is-referenced-by-count":38,"title":["A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows"],"prefix":"10.1016","volume":"21","author":[{"given":"Oya","family":"Icmeli","sequence":"first","affiliation":[]},{"given":"S.Selcuk","family":"Erenguc","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90014-0_BIB1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1080\/05695557308974916","article-title":"Project scheduling under resource constraints historical review and categorization of procedures","author":"Davis","year":"1973","journal-title":"AIIE Trans."},{"key":"10.1016\/0305-0548(94)90014-0_BIB2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1108\/01443579310046454","article-title":"Project scheduling problems: a survey","volume":"13","author":"Icmeli","year":"1993","journal-title":"Ops Prodn Mgmt"},{"key":"10.1016\/0305-0548(94)90014-0_BIB3","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-one programming approach","volume":"23","author":"Doersch","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90014-0_BIB4","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1287\/mnsc.32.10.1291","article-title":"A comparison of heuristics for scheduling projects with cash flows and resource restrictions","volume":"32","author":"Russell","year":"1986","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90014-0_BIB5","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":"Naval Res. logist. Q."},{"key":"10.1016\/0305-0548(94)90014-0_BIB6","series-title":"Presented at the ISMP","article-title":"Some new applications of tabu search","author":"Hertz","year":"1988"},{"key":"10.1016\/0305-0548(94)90014-0_BIB7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014Part i","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Computing"},{"key":"10.1016\/0305-0548(94)90014-0_BIB8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2014Part ii","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Computing"},{"key":"10.1016\/0305-0548(94)90014-0_BIB9","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/mnsc.30.7.854","article-title":"A comparison of exact approaches for solving the multiple constrained resource, project scheduling problems","volume":"30","author":"Patterson","year":"1984","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90014-0_BIB10","article-title":"Solving the maximum clique problem using a tabu search approach","author":"Gendreau","year":"1990","journal-title":"Discrete Appl. Maths"},{"key":"10.1016\/0305-0548(94)90014-0_BIB11","article-title":"An application of tabu search to the symmetric travelling salesman problem","author":"Knox","year":"1988","journal-title":"Ph.D. Thesis"},{"key":"10.1016\/0305-0548(94)90014-0_BIB12","unstructured":"M. Malek, Search methods for travelling salesman problem. Department of Electrical and Computer Engineering, The University of Texas, Austin."},{"key":"10.1016\/0305-0548(94)90014-0_BIB13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA J. Computing"},{"key":"10.1016\/0305-0548(94)90014-0_BIB14","article-title":"Extensions of a tabu search adaptation to the quadratic assignment problem","author":"Skorin-Kapov","year":"1991"},{"key":"10.1016\/0305-0548(94)90014-0_BIB15","article-title":"Robust taboo search for the quadratic assignment problem","author":"Taillard","year":"1990"},{"key":"10.1016\/0305-0548(94)90014-0_BIB16","series-title":"Presented at the First Workshop on Combinatorial Optimization in Science and Technology","article-title":"Bandwidth packing: a tabu search approach","author":"Glover","year":"1991"},{"key":"10.1016\/0305-0548(94)90014-0_BIB17","article-title":"Bin packing with tabu search","author":"Glover","year":"1991","journal-title":"Technical Report, Graduate School of Business Administration, University of Colorado at Bolder"},{"key":"10.1016\/0305-0548(94)90014-0_BIB18","unstructured":"E. Rolland, H. Pirkul and F. Glover, Tabu search for graph partitioning. Working Paper, Graduate School of Management, University of California, Riverside, CA 92521."},{"key":"10.1016\/0305-0548(94)90014-0_BIB19","unstructured":"M. Laguna, J. W. Barnes and F. Glover, Scheduling jobs with linear delay penalties and sequence dependent setup costs using tabu search. Research Report, Department of Mechanical Engineering, The University of Texas, Austin."},{"key":"10.1016\/0305-0548(94)90014-0_BIB20","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1287\/mnsc.21.8.944","article-title":"A comparison of heuristic and optimum solutions in resource constrained project scheduling","volume":"17","author":"Davis","year":"1975","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90014-0_BIB21","author":"Icmeli","year":"1992"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:27:49Z","timestamp":1552930069000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0305054894900140"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90014-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}