Revision as of 03:52, 5 July 2021 edit OAbot (talk \| contribs) Bots 646,409 edits m Open access bot: doi added to citation with #oabot. ← Previous edit		Revision as of 06:47, 12 July 2021 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,850 edits [[Baruch Schieber] Next edit →
Line 22: === Maximizing the profit === '''Bar-Noy, Bar-Yehuda, Freund, Naor and Schieber'''<ref>{{Cite journal\|last=Bar-Noy\|first=Amotz\|last2=Bar-Yehuda\|first2=Reuven\|last3=Freund\|first3=Ari\|last4=(Seffi) Naor\|first4=Joseph\|last5=Schieber\|first5=Baruch\|author5-link=Baruch Schieber\|date=2001-09-01\|title=A unified approach to approximating resource allocation and scheduling\|url=https://doi.org/10.1145/502102.502107\|journal=Journal of the ACM\|volume=48\|issue=5\|pages=1069–1090\|doi=10.1145/502102.502107\|issn=0004-5411}}</ref> consider a setting in which, for each job and machine, there is a ''profit'' for running this job on that machine. They present a 1/2 approximation for discrete input and (1-''ε'')/2 approximation for continuous input. == Extensions ==

Unrelated-machines scheduling: Difference between revisions