{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T06:00:51Z","timestamp":1771480851436,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T00:00:00Z","timestamp":1165881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,3,12]]},"DOI":"10.1007\/s10107-006-0059-3","type":"journal-article","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T20:15:20Z","timestamp":1165868120000},"page":"209-228","source":"Crossref","is-referenced-by-count":51,"title":["Machine scheduling with resource dependent processing times"],"prefix":"10.1007","volume":"110","author":[{"given":"Alexander","family":"Grigoriev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,12]]},"reference":[{"key":"59_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. Blazewicz","year":"1983","unstructured":"Blazewicz J., Lenstra J.K. and Rinnooy Kan A.H.G. (1983). Scheduling subject to resource constraints: Classification and complexity. Discr. Appl. Math. 5: 11\u201324","journal-title":"Discr. Appl. Math."},{"key":"59_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000030685.31167.11","volume":"129","author":"Z.-L. Chen","year":"2004","unstructured":"Chen Z.-L. (2004). Simultaneous job scheduling and resource allocation on parallel machines. Ann. Oper. Res. 129: 135\u2013153","journal-title":"Ann. Oper. Res."},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp.323\u2013332. (2002).","DOI":"10.1109\/SFCS.2002.1181955"},{"key":"59_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completenes","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R. and Johnson D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completenes. Freeman, W.H. New York"},{"key":"59_CR5","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham R.L. (1966). Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45: 1563\u20131581","journal-title":"Bell Syst. Tech. J."},{"key":"59_CR6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham R.L. (1969). Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17: 416\u2013429","journal-title":"SIAM J. Appl. Math."},{"key":"59_CR7","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. and Rinnooy Kan A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discr. Math. 5: 287\u2013326","journal-title":"Ann. Discr. Math."},{"key":"59_CR8","unstructured":"Grigoriev, A., Kellerer, H., Strusevich, V.A.: Scheduling parallel dedicated machines with the speeding-up resource, manuscript (2003). Extended abstract. In: Proceedings of the 6th Workshop on Models and Algorithms for Planning and Scheduling Problems, pp. 131\u2013132 (2003)"},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"Grigoriev A., Sviridenko M., Uetz M.: Unrelated parallel machine scheduling with resource dependent processing times. In: Integer Programming and Combinatorial Optimization, J\u00fcnger, M., Kaibel, V. (eds.) Lecture Notes in Computer Science, 3509, pp. 182\u2013195. Springer, Berlin Heidelberg New York (2005)","DOI":"10.1007\/11496915_14"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Grigoriev, A., Sviridenko, M., Uetz, M.: LP Rounding and an almost harmonic algorithm for scheduling with resource dependent processing times. In: Approximation, Randomization and Combinatorial Optimization, Diaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) Lecture Notes in Computer Science, 4110, pp. 140\u2013151. Springer, Berlin Heidelberg New York (2006)","DOI":"10.1007\/11830924_15"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Grigoriev, A., Uetz, M.: Scheduling parallel jobs with linear speedup. In: Approximation and Online Algorithms. Erlebach, T., Persiano, P. (eds.) Lecture Notes in Computer Science, vol. 3879, pp. 203\u2013215. Springer, Berlin Heidelberg New York (2006)","DOI":"10.1007\/11671411_16"},{"key":"59_CR12","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum D.S. and Shmoys D.B. (1987). Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34: 144\u2013162","journal-title":"J. ACM"},{"key":"59_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s00453-003-1078-6","volume":"39","author":"K. Jansen","year":"2004","unstructured":"Jansen K. (2004). Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme. Algorithmica 39: 59\u201381","journal-title":"Algorithmica"},{"key":"59_CR14","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/S0305-0548(03)00101-1","volume":"31","author":"K. Jansen","year":"2004","unstructured":"Jansen K. and Mastrolilli M. (2004). Approximation schemes for parallel machine scheduling problems with controllable processing times. Comput. Oper. Res. 31: 1565\u20131581","journal-title":"Comput. Oper. Res."},{"key":"59_CR15","unstructured":"Kellerer, H.: Personal Communication (2005)"},{"key":"59_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0377-2217(02)00246-1","volume":"147","author":"H. Kellerer","year":"2003","unstructured":"Kellerer H. and Strusevich V.A. (2003). Scheduling parallel dedicated machines under a single non-shared resource. Euro. J. Oper. Res. 147: 345\u2013364","journal-title":"Euro. J. Oper. Res."},{"key":"59_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0166-218X(03)00433-5","volume":"133","author":"H. Kellerer","year":"2004","unstructured":"Kellerer H. and Strusevich V.A. (2004). Scheduling problems for parallel dedicated machines under multiple resource constraints. Discr. Appl. Math. 133: 45\u201368","journal-title":"Discr. Appl. Math."},{"key":"59_CR18","doi-asserted-by":"crossref","unstructured":"Kelley, J.E., Walker, M.R.: Critical Path Planning and Scheduling: An Introduction. Mauchly Associates, Ambler (PA) (1959)","DOI":"10.1145\/1460299.1460318"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for scheduling on multiple machines. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 254\u2013263 (2005)","DOI":"10.1109\/SFCS.2005.21"},{"key":"59_CR20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra J.K., Shmoys D.B. and Tardos \u00c9. (1990). Approximation algorithms for scheduling unrelated parallel machines. Math. Progr. Ser. A 46: 259\u2013271","journal-title":"Math. Progr. Ser. A"},{"key":"59_CR21","doi-asserted-by":"crossref","unstructured":"Mounie, G., Rapine, C., Trystram, D.: Efficient approximation algorithms for scheduling malleable tasks. In: Proceedings of the 11th ACM Symposium on Parallel Algorithms and Architectures, pp. 23\u201332 (1999)","DOI":"10.1145\/305619.305622"},{"key":"59_CR22","unstructured":"Mounie, G., Rapine, C., Trystram, D.: A 3\/2-dual approximation algorithm for scheduling independent monotonic malleable tasks. Manuscript. Retrieved from http:\/\/citeseer.csail.mit.edu\/558879.html"},{"key":"59_CR23","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys D.B. and Tardos \u00c9. (1993). An approximation algorithm for the generalized assignment problem. Math. Progr. Ser. A 62: 461\u2013474","journal-title":"Math. Progr. Ser. A"},{"key":"59_CR24","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/moor.23.4.909","volume":"23","author":"M. Skutella","year":"1998","unstructured":"Skutella M. (1998). Approximation algorithms for the discrete time-cost tradeoff problem. Math. Oper. Res. 23: 909\u2013929","journal-title":"Math. Oper. Res."},{"key":"59_CR25","doi-asserted-by":"crossref","unstructured":"Turek, J., Wolf, J.L., Yu, P.S.: Approximate algorithms for scheduling parallelizable tasks. In: Proceedings of the 4th ACM symposium on parallel algorithms and architectures, pp. 323--332 (1992)","DOI":"10.1145\/140901.141909"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0059-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0059-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0059-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T08:55:00Z","timestamp":1736672100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0059-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,12]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,12]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0059-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,12]]}}}