Abstract
The online parallel-batch scheduling problem on single unbounded machine to minimize total weighted job completion time is studied. For the general case of processing time, we give an online algorithm with competitive ratio 5+1. When all jobs have identical processing times, we provide an optimal online algorithm.
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.
