Online scheduling of jobs with favorite machines

12/04/2018
by   Cong Chen, et al.
0

This work introduces a natural variant of the online machine scheduling problem on unrelated machines, which we refer to as the favorite machine model. In this model, each job has a minimum processing time on a certain set of machines, called favorite machines, and some longer processing times on other machines. This type of costs (processing times) arise quite naturally in many practical problems. In the online version, jobs arrive one by one and must be allocated irrevocably upon each arrival without knowing the future jobs. We consider online algorithms for allocating jobs in order to minimize the makespan. We obtain tight bounds on the competitive ratio of the greedy algorithm and characterize the optimal competitive ratio for the favorite machine model. Our bounds generalize the previous results of the greedy algorithm and the optimal algorithm for the unrelated machines and the identical machines. We also study a further restriction of the model, called the symmetric favorite machine model, where the machines are partitioned equally into two groups and each job has one of the groups as favorite machines. We obtain a 2.675-competitive algorithm for this case, and the best possible algorithm for the two machines case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2022

Online Scheduling of Time-Critical Tasks to Minimize the Number of Calibrations

We study the online scheduling problem where the machines need to be cal...
research
04/12/2019

Maximizing Online Utilization with Commitment

We investigate online scheduling with commitment for parallel identical ...
research
01/20/2020

A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model

Online scheduling in identical machines with makespan minimization has b...
research
05/14/2018

Online interval scheduling to maximize total satisfaction

The interval scheduling problem is one variant of the scheduling problem...
research
06/29/2023

Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs

We consider the Online Rent Minimization problem, where online jobs with...
research
06/06/2018

Online Makespan Minimization: The Power of Restart

We consider the online makespan minimization problem on identical machin...
research
05/30/2020

Scheduling in the Random-Order Model

Makespan minimization on identical machines is a fundamental problem in ...

Please sign up or login with your details

Forgot password? Click here to reset