{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T20:40:16Z","timestamp":1791232816896,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642022692","type":"print"},{"value":"9783642022708","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_29","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T05:17:47Z","timestamp":1245388667000},"page":"283-292","source":"Crossref","is-referenced-by-count":7,"title":["Approximating Scheduling Machines with Capacity Constraints"],"prefix":"10.1007","author":[{"given":"Chi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoguang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-44676-1_16","volume-title":"Algorithms - ESA 2001","author":"E. Angel","year":"2001","unstructured":"Angel, E., Bampis, E., Kononov, A.: A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 194\u2013205. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2007.02.056","volume":"380","author":"M. Gairing","year":"2007","unstructured":"Gairing, M., Monien, B., Woclaw, A.: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci.\u00a0380(1-2), 87\u201399 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM\u00a034, 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica\u00a021, 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"29_CR5","first-page":"1093","volume":"244","author":"L.G. Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm for linear programming. Doklady Akademiia Nauk USSR\u00a0244, 1093\u20131096 (1979); A translation appears in: Soviet Mathematics Doklady 20, 191\u2013194, (1979) (in Russian)","journal-title":"Doklady Akademiia Nauk USSR"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Programming\u00a046, 259\u2013271 (1990)","journal-title":"Math. Programming"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: The Thirty-Ninth Annual ACM Symposium on Theory of Computing, San Diego, California, USA, pp. 661\u2013670 (2007)","DOI":"10.1145\/1250790.1250887"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1137\/0221007","volume":"21","author":"L.H. Tsai","year":"1992","unstructured":"Tsai, L.H.: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling. SIAM Journal on Computing\u00a021, 59\u201394 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"29_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.disopt.2005.06.005","volume":"2","author":"G.J. Woeginger","year":"2005","unstructured":"Woeginger, G.J.: A comment on scheduling two parallel machines with capacity constraints. Discrete Optimization\u00a02(3), 269\u2013272 (2005)","journal-title":"Discrete Optimization"},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0166-218X(02)00601-7","volume":"130","author":"H. Yang","year":"2003","unstructured":"Yang, H., Ye, Y., Zhang, J.: An approximation algorithm for scheduling two parallel machines with capacity constraints. Discrete Applied Mathematics\u00a0130(3), 449\u2013467 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR11","unstructured":"Zhang, J., Ye, Y.: On the Budgeted MAX-CUT problem and its Application to the Capacitated Two-Parallel Machine Scheduling. Working Paper, Department of Management Sciences, The University of Iowa (2001)"},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/trsc.19.2.127","volume":"19","author":"M.M. Etschmaier","year":"1985","unstructured":"Etschmaier, M.M., Mathaisel, D.F.X.: Airline Scheduling: An Overview. Transportation Science\u00a019(2), 127\u2013138 (1985)","journal-title":"Transportation Science"},{"key":"29_CR13","unstructured":"Rushmeier, R.A., Hoffman, K.L., Padberg, M.: Recent Advances in Exact Optimization of Airline Scheduling Problems. Technical Report, George Mason University (1995)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T22:06:44Z","timestamp":1552082804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}