{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:47:16Z","timestamp":1770504436108,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[[1991,1]]},"DOI":"10.1016\/0305-0548(91)90001-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"635-643","source":"Crossref","is-referenced-by-count":74,"title":["A GRASP\u2122 for a difficult single machine scheduling problem"],"prefix":"10.1016","volume":"18","author":[{"given":"Thomas A.","family":"Feo","sequence":"first","affiliation":[]},{"given":"Krishnamurthi","family":"Venkatraman","sequence":"additional","affiliation":[]},{"given":"Jonathan F.","family":"Bard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(91)90001-8_BIB1","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0305-0548(91)90001-8_BIB2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(87)90033-5","article-title":"A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden","volume":"14","author":"Fry","year":"1987","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(91)90001-8_BIB3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/opre.35.2.311","article-title":"An improved lower bound for minimizing weighted completion times with deadlines","volume":"35","author":"Bagchi","year":"1987","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90001-8_BIB4","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.35.3.378","article-title":"Scheduling tasks with due dates in a fabrication\/assembly process","volume":"35","author":"Faaland","year":"1987","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90001-8_BIB5","doi-asserted-by":"crossref","unstructured":"T. Sen, F. Raizadeh and P. Dileepan, A branch and bound approach the bicriterion problem involving total flow time and range of lateness. Mgmt Sci. 34, 254\u2013260.","DOI":"10.1287\/mnsc.34.2.254"},{"key":"10.1016\/0305-0548(91)90001-8_BIB6","article-title":"A dynamic programming approach to a single machine scheduling problem","author":"Bard","year":"1989"},{"key":"10.1016\/0305-0548(91)90001-8_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","article-title":"Semi-greedy heuristics: an empirical study","volume":"6","author":"Hart","year":"1987","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(91)90001-8_BIB8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A probabilistic heuristic for a computationally difficult set covering problem","volume":"8","author":"Feo","year":"1989","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(91)90001-8_BIB9","article-title":"A greedy randomized adaptive search procedure for maximum independent set","author":"Feo","year":"1989"},{"key":"10.1016\/0305-0548(91)90001-8_BIB10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/mnsc.35.2.249","article-title":"Operations sequencing in discrete parts manufacturing","volume":"35","author":"Bard","year":"1989","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(91)90001-8_BIB11","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1287\/mnsc.35.12.1415","article-title":"Flight scheduling and maintenance base planning","volume":"35","author":"Feo","year":"1989","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(91)90001-8_BIB12","article-title":"Avoiding local optima in the p-hub location problem using tabu search and GRASP","author":"Klincewicz","year":"1989"},{"key":"10.1016\/0305-0548(91)90001-8_BIB13","article-title":"A search heuristic for just-in-time scheduling in parallel machines","author":"Laguna","year":"1990"},{"key":"10.1016\/0305-0548(91)90001-8_BIB14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90001-8_BIB15","series-title":"Decision Systems for Inventory Management and Production Planning","author":"Silver","year":"1985"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054891900018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054891900018?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:22:22Z","timestamp":1552915342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054891900018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0305054891900018"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(91)90001-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}