Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed for time units completes units of execution. The on-line scheduling of hard-real-time systems, in which all jobs must complete by specified deadlines, on uniform multiprocessor machines is considered. It is known that online...

In the load balancing (or job scheduling) problem, introduced by Graham in the 1960s (SIAM J. of Appl. Math. 1966, 1969), jobs arriving online have to be assigned to machines so to minimize an objective defined on machine loads. A long line of work has addressed this problem for both the makespan norm and arbitrary lq-norms of machine loads. Recent literature (e.g., Azar et al., STOC 2013; Im e...

Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes ðs tÞ units of execution. The earliestdeadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is known that online algorithms tend to perf...

In real-life applications, neither all the inputs of an algorithm are available at outset, as in offline framework, nor do they occur one by order, online setup. Semi-online is intermediate theoretically and practically significant framework with additional information on successive to address limitations frameworks. One key motivation for studying semi-online algorithms investigate how can imp...

We consider the problem of efficiently scheduling jobs on data centers to minimize the cost of renting machines from “the cloud.” In the most basic cloud service model, cloud providers offer computers on demand from large pools installed in data centers. Clients pay for use at an hourly rate. In order to minimize cost, each client needs to decide on the number of machines to be rented and the d...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

For a long time, optimal competitive factors of online algorithms used to be approximated by manually finding and improving upper and lower bounds. The concept of a competitive ratio approximation scheme (CRAS), introduced by Günther et al. in 2012 [13], defines a method of reducing this process to a task that can be executed automatically by a computer up to an arbitrarily good precision: A CR...

In this paper, we introduce a new online scheduling framework for minimizing total weighted completion time in a general setting. The framework is inspired by the work of Hall et al. [12] and Garg et al. [9], who show how to convert an offline approximation to an online scheme. Our framework uses two offline approximation algorithms—one for the simpler problem of scheduling without release time...