Abstract
We consider online parallel-batch scheduling of [Formula: see text] incompatible unit-length job families with variable lookahead interval to minimize the maximum completion time, where [Formula: see text] is the number of job families which is known in advance. Incompatible job family means that a batch only contains the jobs from the same job family. At any time [Formula: see text], an online algorithm can foresee the information of the jobs arriving in the time interval [Formula: see text], where [Formula: see text] is variable. When the batch capacity [Formula: see text] and [Formula: see text], we provide a best possible online algorithm with competitive ratio [Formula: see text] for [Formula: see text] and [Formula: see text], where [Formula: see text] is a positive root of [Formula: see text]. When the batch capacity [Formula: see text] and [Formula: see text], we give an online algorithm with competitive ratio [Formula: see text] for [Formula: see text] and [Formula: see text], and prove that it is the best possible for [Formula: see text] and [Formula: see text].
Sign-in/Register to access full text options 
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.
