{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T03:14:40Z","timestamp":1768619680692,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0167-6377(01)00080-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:37:03Z","timestamp":1027615023000},"page":"41-47","source":"Crossref","is-referenced-by-count":12,"title":["A -approximation algorithm for parallel machine scheduling with controllable processing times"],"prefix":"10.1016","volume":"29","author":[{"given":"Feng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Long","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00080-3_BIB1","unstructured":"Z.-L. Chen, Simultaneous job scheduling and resource allocation on parallel machines. Working Paper, Department of Systems Engineering, University of Pennsylvania, Philadelphia, PA, 1999."},{"key":"10.1016\/S0167-6377(01)00080-3_BIB2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0167-6377(97)00010-2","article-title":"Single machine scheduling with discretely controllable processing times","volume":"21","author":"Chen","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00080-3_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/07408179608966263","article-title":"Parallel machine scheduling with controllable processing times","volume":"28","author":"Cheng","year":"1996","journal-title":"IIE Trans."},{"key":"10.1016\/S0167-6377(01)00080-3_BIB4","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1998"},{"key":"10.1016\/S0167-6377(01)00080-3_BIB5","doi-asserted-by":"crossref","unstructured":"J.A. Hoogeveen, P. Schuurman, G. Woeginger, Non-approximability results for scheduling problems with minsum criteria, Proceedings of IPCO 98, pp. 353\u2013366.","DOI":"10.1007\/3-540-69346-7_27"},{"key":"10.1016\/S0167-6377(01)00080-3_BIB6","unstructured":"J.A. Hoogeveen, G.J. Woeginger, Scheduling with controllable processing times. Manuscript, Department of Mathematics, TU Graz, Graz, Austria, 1998."},{"key":"10.1016\/S0167-6377(01)00080-3_BIB7","first-page":"15","article-title":"An O(n2) algorithm for a controllable machine scheduling problem","volume":"10","author":"Huang","year":"1999","journal-title":"IMA J. Math. Appl. Business Industry"},{"key":"10.1016\/S0167-6377(01)00080-3_BIB8","series-title":"Handbooks in Operations Research and Management Science, Vol. 4","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and scheduling: Algorithms and complexity","author":"Lawler","year":"1993"},{"key":"10.1016\/S0167-6377(01)00080-3_BIB9","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0167-6377(01)00080-3_BIB10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","article-title":"A survey of results for sequencing problems with controllable processing times","volume":"26","author":"Nowicki","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(01)00080-3_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(94)00071-5","article-title":"A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times","volume":"63","author":"Nowicki","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(01)00080-3_BIB12","doi-asserted-by":"crossref","unstructured":"M. Skutella, Semidefinite relaxation for parallel machine scheduling, Proceedings of 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 472\u2013481.","DOI":"10.1109\/SFCS.1998.743498"},{"key":"10.1016\/S0167-6377(01)00080-3_BIB13","doi-asserted-by":"crossref","unstructured":"M. Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. Assoc. Comput. Mach. 48 (2001) 206\u2013242.","DOI":"10.1145\/375827.375840"},{"key":"10.1016\/S0167-6377(01)00080-3_BIB14","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1287\/opre.42.2.234","article-title":"Scheduling multiple variable-speed machines","volume":"42","author":"Trick","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00080-3_BIB15","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","article-title":"Choosing the job sequence and processing times to minimize total processing plus flow cost on single machine","volume":"28","author":"Vickson","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00080-3_BIB16","unstructured":"F. Zhang, G. Tang, Z.-L. Chen, A 32-approximation algorithm for parallel machine scheduling with controllable processing times, Working paper, Department of Systems Engineering, University of Pennsylvania, Philadelphia, PA, 2000."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000803?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000803?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T21:52:30Z","timestamp":1556229150000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0167637701000803"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00080-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}