{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:53:12Z","timestamp":1772297592122,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11581,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1981,11]]},"DOI":"10.1016\/0166-218x(81)90008-1","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"313-318","source":"Crossref","is-referenced-by-count":81,"title":["Fast approximation algorithm for job sequencing with deadlines"],"prefix":"10.1016","volume":"3","author":[{"given":"G.V.","family":"Gens","sequence":"first","affiliation":[]},{"given":"E.V.","family":"Levner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(81)90008-1_BIB1","first-page":"761","article-title":"Linear functions on the N-dimensional unit cube","volume":"222","author":"Babat","year":"1975","journal-title":"Soviet Math. Dokl"},{"key":"10.1016\/0166-218X(81)90008-1_BIB2","first-page":"38","article-title":"Approximation algorithms for some scheduling problems","volume":"6","author":"Gens","year":"1978","journal-title":"Engeneering Cybernetics"},{"key":"10.1016\/0166-218X(81)90008-1_BIB3","first-page":"292","article-title":"Computational complexity of approximation algorithms for combinatorial problems","volume":"Vol. 74","author":"Gens","year":"1979"},{"key":"10.1016\/0166-218X(81)90008-1_BIB4","article-title":"Fast approximation algorithms for knapsack type problem","volume":"Vol. 23","author":"Gens","year":"1980"},{"key":"10.1016\/0166-218X(81)90008-1_BIB5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. Assoc. Comput. Mach"},{"key":"10.1016\/0166-218X(81)90008-1_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"1","key":"10.1016\/0166-218X(81)90008-1_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource alocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Sci."},{"issue":"1","key":"10.1016\/0166-218X(81)90008-1_BIB8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"J. Assoc. Comput. Mach"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900081?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900081?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:23:13Z","timestamp":1555190593000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X81900081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["0166218X81900081"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(81)90008-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}