{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:53:22Z","timestamp":1649192002821},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0377-2217(97)00096-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:48:22Z","timestamp":1027619302000},"page":"160-169","source":"Crossref","is-referenced-by-count":1,"title":["Random sequencing jobs with deadlines problem: Growth of the optimal solution values"],"prefix":"10.1016","volume":"109","author":[{"given":"Krzysztof","family":"Szkatu\u0142a","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00096-9_BIB1","series-title":"Scheduling Computer and Manufacturing Processes","author":"Bz.xl;lazewicz","year":"1996"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0377-2217(84)90053-5","article-title":"Approximation algorithms for the m-dimensional 0\u20131 Knapsack problem: Worst case and probabilistic analysis","volume":"15","author":"Frieze","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0377-2217(92)90151-X","article-title":"A note on sequencing jobs with deadlines problem","volume":"59","author":"Dudzi\u0144ski","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB4","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocationmand sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(90)90004-V","article-title":"On the growth of random knapsacks","volume":"28","author":"Mamer","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB7","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent jobs","volume":"23","author":"Sahni","year":"1976","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0377-2217(90)90303-S","article-title":"The growth of m-constraint random knapsacks","volume":"46","author":"Schilling","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(92)00125-6","article-title":"Random Knapsacks with many constraints","volume":"48","author":"Schilling","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0377-2217(94)90164-3","article-title":"On the growth of multi-constraint random knapsacks with various right-hand sides of the constraints","volume":"73","author":"Szkatula","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00096-9_BIB11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0167-6377(97)00024-2","article-title":"The growth of multi-constraint random knapsacks with large right-hand sides of the constraints","volume":"21","author":"Szkatula","year":"1997","journal-title":"Operations Research Letters"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797000969?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797000969?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:57:29Z","timestamp":1556110649000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797000969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0377221797000969"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00096-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}