This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time. For this NP-hard problem, the largest sum of release date, processing time and delivery time first rule is designed to determine a certain machine for each job, and the largest difference between delivery time and release date first rule is ...

We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-objective analysis, namely simultaneous optimization of the makespan and the reliability. We show that this problem can not be approximated by a single schedule. A similar problem has already been studied leading to a...

This paper considers the uniform parallel machine scheduling problem which is to minimize the maximum lateness. This problem is equivalent to the uniform parallel machine scheduling problem, which is to minimize the maximal completion time of n jobs whose release times are zero, processing times depend on the speed of the machine to which they are assigned, and their delivery times are differen...

The single-stage scheduling problem to minimize the makespan of identical jobs with general release times on uniform parallel machines is known to be solvable in polynomial time using the latest start time (LST) rule to determine the optimal schedule. In this paper, we first show that the two-stage problem is NP-hard using a known result that the three-stage problem with equal job release times...

Consider that one job after another arrives online and must be placed on machines immediately, without knowing which jobs might arrive later. The goal is to balance the load of – sizes divided by machine speed. Each contributes a migration potential proportional its size, can used relocate some previously jobs. This paper presents results with improved competitiveness compared pure case using o...

Abstract In the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with sizes. A algorithm has to assign m parallel machines. The objective is minimize makespan, which time it takes until all processed. this paper, consider online algorithms without preemption. However, allow change assignment up k at end for some limited number . For identical machines, Alber...

One common cause of poor performance in large-scale shared-memory multiprocessors is limited memory or interconnection network bandwidth. Even well-designed machines can exhibit band-width limitations when a program issues an excessive number of remote memory accesses or when remote accesses are distributed non-uniformly. While techniques for improving locality of reference are often successful...