{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:50:15Z","timestamp":1770292215058,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T00:00:00Z","timestamp":1192838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2007,10,25]]},"DOI":"10.1007\/s10951-007-0044-6","type":"journal-article","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T09:11:19Z","timestamp":1192785079000},"page":"341-352","source":"Crossref","is-referenced-by-count":22,"title":["A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine"],"prefix":"10.1007","volume":"10","author":[{"given":"Liron","family":"Yedidsion","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Kaspi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,20]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(93)90245-I","volume":"70","author":"B. Alidaee","year":"1993","unstructured":"Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70, 335\u2013341.","journal-title":"European Journal of Operational Research"},{"key":"44_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0167-6377(95)00011-8","volume":"17","author":"T. C. E. Cheng","year":"1995","unstructured":"Cheng, T. C. E., & Kovalyov, M. Y. (1995). Single machine batch scheduling with deadlines and resource dependent processing times. Operations Research Letters, 17, 243\u2013249.","journal-title":"Operations Research Letters"},{"issue":"2","key":"44_CR3","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S1052623495288192","volume":"8","author":"T. C. E. Cheng","year":"1998","unstructured":"Cheng, T. C. E., Janiak, A., & Kovalyov, M. Y. (1998). Bicriterion single machine scheduling with resource dependent processing times. SIAM Journal on Optimization, 8(2), 617\u2013630.","journal-title":"SIAM Journal on Optimization"},{"issue":"6","key":"44_CR4","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.37.6.981","volume":"37","author":"R. L. Daniels","year":"1989","unstructured":"Daniels, R. L., & Sarin, R. K. (1989). Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research, 37(6), 981\u2013984.","journal-title":"Operations Research"},{"key":"44_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s00607-001-1441-x","volume":"68","author":"H. Hoogeveen","year":"2002","unstructured":"Hoogeveen, H., & Woeginger, G. J. (2002). Some comments on sequencing with controllable processing times. Computing, 68, 181\u2013192.","journal-title":"Computing"},{"key":"44_CR6","unstructured":"Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Management Sciences Research Project, Research Report 43, UCLA."},{"issue":"4","key":"44_CR7","first-page":"289","volume":"23","author":"A. Janiak","year":"1987","unstructured":"Janiak, A. (1987). One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika, 23(4), 289\u2013293.","journal-title":"Kybernetika"},{"key":"44_CR8","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","volume":"94","author":"A. Janiak","year":"1996","unstructured":"Janiak, A., & Kovalyov, M. Y. (1996). Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research, 94, 284\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"44_CR9","unstructured":"Karush, W. (1939). Minima of functions of several variables with inequalities as side conditions. MS thesis, Department of Mathematics, University of Chicago."},{"issue":"10","key":"44_CR10","doi-asserted-by":"crossref","first-page":"3015","DOI":"10.1016\/j.cor.2005.02.032","volume":"33","author":"M. Kaspi","year":"2006","unstructured":"Kaspi, M., & Shabtay, D. (2006). A bicriterion approach to time\/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers and Operations Research, 33(10), 3015\u20133033.","journal-title":"Computers and Operations Research"},{"key":"44_CR11","first-page":"481","volume-title":"Proceedings of the second symposium","author":"H. W. Kuhn","year":"1951","unstructured":"Kuhn, H. W., & Tucker, A. W. (1951). Nonlinear programming. In Proceedings of the second symposium (pp.\u00a0481\u2013492). Berkeley: University of California Press."},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1010918518726","volume":"102","author":"C. Y. Lee","year":"2001","unstructured":"Lee, C. Y., & Lei, L. (2001). Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases. Annals of Operations Research, 102, 287\u2013307.","journal-title":"Annals of Operations Research"},{"key":"44_CR13","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/moor.15.4.736","volume":"15","author":"C. L. Monma","year":"1990","unstructured":"Monma, C. L., Schrijver, A., Todd, M. J., & Wei, V. K. (1990). Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Mathematics of Operations Research, 15, 736\u2013748.","journal-title":"Mathematics of Operations Research"},{"key":"44_CR14","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1016\/S0305-0548(02)00066-7","volume":"30","author":"C. T. D. Ng","year":"2003","unstructured":"Ng, C. T. D., Cheng, T. C. E., Kovalyov, M. Y., & Lam, S. S. (2003). Single machine scheduling with a variable common due date and resource-dependent processing times. Computer and Operations Research, 30, 1173\u20131185.","journal-title":"Computer and Operations Research"},{"key":"44_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E. Nowicki","year":"1990","unstructured":"Nowicki, E., & Zdrzalka, S. (1990). A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics, 26, 271\u2013287.","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"44_CR16","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1016\/S0305-0548(03)00081-9","volume":"31","author":"D. Shabtay","year":"2004","unstructured":"Shabtay, D. (2004). A single and a two-resource allocation problem for minimizing the maximal lateness in a single machine-scheduling problem. Computers and Operations Research, 31(8), 1303\u20131315.","journal-title":"Computers and Operations Research"},{"issue":"13","key":"44_CR17","doi-asserted-by":"crossref","first-page":"2279","DOI":"10.1016\/S0305-0548(03)00187-4","volume":"31","author":"D. Shabtay","year":"2004","unstructured":"Shabtay, D., & Kaspi, M. (2004). Minimizing the total weighted flow time in a single machine with controllable processing times. Computers and Operations Research, 31(13), 2279\u20132289.","journal-title":"Computers and Operations Research"},{"issue":"13","key":"44_CR18","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D. Shabtay","year":"2007","unstructured":"Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Shabtay, D., & Steiner, G. (2007, in press). Single machine batch scheduling to minimize total completion time and resource consumption costs. Journal of Scheduling.","DOI":"10.1007\/s10951-007-0025-9"},{"key":"44_CR20","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.dam.2005.04.014","volume":"154","author":"N. V. Shakhlevich","year":"2006","unstructured":"Shakhlevich, N. V., & Strusevich, V. A. (2006). Single machine scheduling with controllable release and processing times. Discrete Applied Mathematics, 154, 2178\u20132199.","journal-title":"Discrete Applied Mathematics"},{"key":"44_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","volume":"11","author":"L. Wassenhove Van","year":"1982","unstructured":"Van Wassenhove, L., & Baker, K. R. (1982). A bicriterion approach to time\/cost trade-offs in sequencing. European Journal of Operational Research, 11, 48\u201354.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"44_CR22","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"R. G. Vickson","year":"1980","unstructured":"Vickson, R. G. (1980). Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12(3), 258\u2013262.","journal-title":"AIIE Transactions"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0044-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0044-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0044-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:40Z","timestamp":1559453980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0044-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,20]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,10,25]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0044-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,20]]}}}