{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:09:43Z","timestamp":1772021383407,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540345978","type":"print"},{"value":"9783540345985","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_18","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T08:37:56Z","timestamp":1148027876000},"page":"195-206","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling Unrelated Parallel Machines Computational Results"],"prefix":"10.1007","author":[{"given":"Burkhard","family":"Monien","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Woclaw","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research\u00a08, 101\u2013111 (1960)","journal-title":"Operations Research"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1145\/322276.322284","volume":"28","author":"E. Davis","year":"1981","unstructured":"Davis, E., Jaffe, J.M.: Algorithms for scheduling tasks on unrelated parallel processors. Journal of ACM\u00a028, 721\u2013736 (1981)","journal-title":"Journal of ACM"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: Proceedings of the 36th Annual ACM Symposium on the Thoery of Computing (STOC 2004), pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/11523468_67","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2005","unstructured":"Gairing, M., Monien, B., Woclaw, A.: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 828\u2013839. Springer, Heidelberg (2005)"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0895-7177(94)90205-4","volume":"20","author":"P. Glass","year":"1994","unstructured":"Glass, P., Potts, C., Shade, P.: Unrelated parallel machine scheduling using local search. Mathematical Computing Modeling\u00a020(2), 41\u201352 (1994)","journal-title":"Mathematical Computing Modeling"},{"key":"18_CR7","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.: Bounds for certain multiprocessor anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"18_CR8","doi-asserted-by":"publisher","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 Ken, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), pp. 68\u201377 (1996)","DOI":"10.1109\/SFCS.1996.548465"},{"key":"18_CR10","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, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0377-2217(01)00270-3","volume":"141","author":"E. Mokotoff","year":"2002","unstructured":"Mokotoff, E., Chr\u00e9tienne, P.: A cutting plane algorithm for the unrelated parallel machine scheduling problem. European Journal of Operational Research\u00a0141, 515\u2013525 (2002)","journal-title":"European Journal of Operational Research"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1021569406280","volume":"117","author":"E. Mokotoff","year":"2002","unstructured":"Mokotoff, E., Jimeno, J.L.: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Annals of Operations Research\u00a0117, 133\u2013150 (2002)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0304-3975(03)00403-1","volume":"312","author":"T. Radzik","year":"2004","unstructured":"Radzik, T.: Improving time bounds on maximum generalised flow computations by contracting the network. Theoretical Computer Science\u00a0312(1), 75\u201397 (2004)","journal-title":"Theoretical Computer Science"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.orl.2004.05.004","volume":"33","author":"E.V. Shchepin","year":"2005","unstructured":"Shchepin, E.V., Vakhania, N.: An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters\u00a033, 127\u2013133 (2005)","journal-title":"Operations Research Letters"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1023\/A:1011960407575","volume":"7","author":"F. Sourd","year":"2001","unstructured":"Sourd, F.: Scheduling tasks on unrelated machines: Large neighborhood improvement procedures. Journal of Heuristics\u00a07, 519\u2013531 (2001)","journal-title":"Journal of Heuristics"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0132037","volume":"32","author":"K. Truemper","year":"1977","unstructured":"Truemper, K.: On max flows with gains and pure min-cost flows. SIAM Journal on Applied Mathematics\u00a032(2), 450\u2013456 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: Speeding up linear programming using fast matrix multiplication. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), pp. 332\u2013337 (1989)","DOI":"10.1109\/SFCS.1989.63499"},{"issue":"2","key":"18_CR18","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1287\/ijoc.5.2.182","volume":"5","author":"S.L. Velde van de","year":"1993","unstructured":"van de Velde, S.L.: Duality-based algorithms for scheduling unrelated parallel machines. ORSA Journal on Computing\u00a05(2), 182\u2013205 (1993)","journal-title":"ORSA Journal on Computing"},{"issue":"6","key":"18_CR19","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"J.M. Akker van den","year":"1999","unstructured":"van den Akker, J.M., Hoogeveen, J.A., van de Velde, S.L.: Parallel machine scheduling by column generation. Operations Research\u00a047(6), 862\u2013872 (1999)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:52Z","timestamp":1619507452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11764298_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}