{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T16:56:57Z","timestamp":1768150617322,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,3]],"date-time":"2011-03-03T00:00:00Z","timestamp":1299110400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10479-010-0827-6","type":"journal-article","created":{"date-parts":[[2011,3,2]],"date-time":"2011-03-02T16:12:26Z","timestamp":1299082346000},"page":"383-391","source":"Crossref","is-referenced-by-count":14,"title":["Single machine scheduling with total tardiness criterion and convex controllable processing times"],"prefix":"10.1007","volume":"186","author":[{"given":"Kailiang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Zuren","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Liangjun","family":"Ke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,3]]},"reference":[{"issue":"3","key":"827_CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1080\/03052159908941376","volume":"31","author":"D. Biskup","year":"1999","unstructured":"Biskup, D., & Cheng, T. C. E. (1999). Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Engineering Optimization, 31(3), 329\u2013336.","journal-title":"Engineering Optimization"},{"issue":"3","key":"827_CR2","first-page":"485","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J. & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15(3), 485\u2013495.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"827_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5(1), 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1986","key":"827_CR4","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/BFb0043857","volume":"84","author":"A. Janiak","year":"1986","unstructured":"Janiak, A. (1986). One-machine scheduling problems with resource constraints. Lecture Notes in Control and Information Sciences, 84(1986), 358\u2013364.","journal-title":"Lecture Notes in Control and Information Sciences"},{"issue":"9","key":"827_CR5","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1016\/S0305-0548(03)00103-5","volume":"31","author":"M. Kaspi","year":"2004","unstructured":"Kaspi, M., & Shabtay, D. (2004). Convex resource allocation for minimizing the makespan in a single machine with job release dates. Computers and Operations Research, 31(9), 1481\u20131489.","journal-title":"Computers and Operations Research"},{"key":"827_CR6","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"},{"issue":"13","key":"827_CR7","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":"1","key":"827_CR8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ejor.2004.12.008","volume":"173","author":"D. Shabtay","year":"2006","unstructured":"Shabtay, D., & Kaspi, M. (2006). Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research, 173(1), 92\u2013107.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"827_CR9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1080\/07408170601181674","volume":"39","author":"D. Shabtay","year":"2007","unstructured":"Shabtay, D., Kaspi, M., & Steiner, G. (2007). The no-wait two-machine flow-shop scheduling problem with convex resource-dependent processing times. IIE Transactions, 39(5), 539\u2013557.","journal-title":"IIE Transactions"},{"issue":"13","key":"827_CR10","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"},{"issue":"5","key":"827_CR11","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","volume":"28","author":"R. G. Vickson","year":"1980","unstructured":"Vickson, R. G. (1980). Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research, 28(5), 1155\u20131167.","journal-title":"Operations Research"},{"issue":"11","key":"827_CR12","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1016\/j.cor.2009.11.012","volume":"37","author":"K. Xu","year":"2010","unstructured":"Xu, K., Feng, Z., & Jun, K. (2010a). A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates. Computers and Operations Research, 37(11), 1924\u20131938.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"827_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10479-010-0746-6","volume":"181","author":"K. Xu","year":"2010","unstructured":"Xu, K., Feng, Z., & Ke, L. (2010b). A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates. Annals of Operations Research, 181(1), 303\u2013324.","journal-title":"Annals of Operations Research"},{"issue":"9","key":"827_CR14","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/0167-6377(91)90071-V","volume":"10","author":"S. Zdrzalka","year":"1991","unstructured":"Zdrzalka, S. (1991). Scheduling jobs on a single machine with release dates, delivery times, and controllable processing times: worst-case analysis. Operations Research Letters, 10(9), 519\u2013523.","journal-title":"Operations Research Letters"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0827-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0827-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0827-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:03Z","timestamp":1559153283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0827-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["827"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0827-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,3]]}}}