{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T13:31:41Z","timestamp":1770298301964,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2004,8,1]],"date-time":"2004-08-01T00:00:00Z","timestamp":1091318400000},"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":[[2004,8]]},"DOI":"10.1016\/s0305-0548(03)00103-5","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"1481-1489","source":"Crossref","is-referenced-by-count":34,"title":["Convex resource allocation for minimizing the makespan in a single machine with job release dates"],"prefix":"10.1016","volume":"31","author":[{"given":"Moshe","family":"Kaspi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0305-0548(03)00103-5_BIB1","first-page":"289","article-title":"One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints","volume":"23","author":"Janiak","year":"1987","journal-title":"Kybernetika"},{"key":"10.1016\/S0305-0548(03)00103-5_BIB2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","article-title":"A bicriterion approach to time\/cost trade-offs in sequencing","volume":"11","author":"Van Wassenhove","year":"1982","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/S0305-0548(03)00103-5_BIB3","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.37.6.981","article-title":"Single machine scheduling with controllable processing times and number of jobs tardy","volume":"37","author":"Daniels","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00103-5_BIB4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0377-2217(90)90376-M","article-title":"A multi-objective approach to resource allocation in single machine scheduling","volume":"48","author":"Daniels","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00103-5_BIB5","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","article-title":"Single machine scheduling subject to deadlines and resource dependent processing times","volume":"94","author":"Janiak","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00103-5_BIB6","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S1052623495288192","article-title":"Bicriterion single machine scheduling with resource dependent processing times","volume":"8","author":"Cheng","year":"1998","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0305-0548(03)00103-5_BIB7","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/moor.15.4.736","article-title":"Convex resource allocation problems on directed acyclic graphs","volume":"15","author":"Monma","year":"1990","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00103-5_BIB8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1080\/00207729508929042","article-title":"Allocation of resources in project management","volume":"26","author":"Scott","year":"1995","journal-title":"International Journal of Systems Science"},{"key":"10.1016\/S0305-0548(03)00103-5_BIB9","first-page":"116","article-title":"An O(N log(1\/\u03b5)) algorithm for the two-resource allocation problem with a non-differentiable convex objective function","volume":"46","author":"Armstrong","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(03)00103-5_BIB10","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1057\/palgrave.jors.2600387","article-title":"Solving a class of two-resource allocation problem by equivalent load method","volume":"48","author":"Armstrong","year":"1997","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(03)00103-5_BIB11","unstructured":"Jackson JR. Scheduling a production line to minimize maximum tardiness. Management Sciences Research Project, Research Report 43, UCLA, 1995."},{"key":"10.1016\/S0305-0548(03)00103-5_BIB12","unstructured":"Karush W. Minima of functions of several variables with inequalities as side conditions. MS thesis, Department of Mathematics, University of Chicago, 1939."},{"key":"10.1016\/S0305-0548(03)00103-5_BIB13","doi-asserted-by":"crossref","unstructured":"Kuhn HW, Tucker AW. Nonlinear programming. Proceedings of the Second Symposium. Berkeley: University of California Press, 1951. p. 481\u201392.","DOI":"10.1525\/9780520411586-036"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T17:48:17Z","timestamp":1734025697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":13,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2004,8]]}},"alternative-id":["S0305054803001035"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00103-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,8]]}}}