Year-end Sale % OFF 
Abstract
We study the problem of scheduling n independent weighted jobs on a constant number of unrelated parallel machines so as to minimize the weighted sum of job completion times Rm∣∣∑wjCj. We present an O(n log n) time approximation scheme for the non-preemptive case of this problem. Notice that when the number of machines is not a constant (i.e. R∣∣∑wjCj) then no PTAS is possible, unless =. Copyright © 2000 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
