Photo by jontyson from unsplash
We consider the classic online scheduling problem on m uniform machines in the online setting where jobs arrive over time. Preemption is not allowed.*e objective is to minimize total weighted… Click to show full abstract
We consider the classic online scheduling problem on m uniform machines in the online setting where jobs arrive over time. Preemption is not allowed.*e objective is to minimize total weighted completion time. An online algorithm based on the directly waiting strategy is proposed. Its competitive performance is proved to be max 2smax(1 − (1/(2???? si))), (2smax/ ???? (1 + smax))(2.5 − (1/2m))} by the idea of instance reduction, where sm is the fastest machine speed after being normalized by the slowest machine speed.
Keywords:
weighted completion;
time;
uniform machines;
completion time;
online;
total weighted
Journal Title: Mathematical Problems in Engineering
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematical Problems in Engineering
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!