Distributed systems have been an active research area in computer science for the last decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i.e. the completion time at the maximum loaded computing node). Load balancing problem is a NP hard problem. This pap...

In this paper, we investigate the applicability of a constraint satisfaction problem solving (CSP) model, recently developed for deadline scheduling, to more commonly studied problems of schedule optimization. Our hypothesis is two-fold: (1) that CSP scheduling techniques provide a basis for developing high-performance approximate solution procedures in optimization contexts, and (2) that the r...

It has become more and more important and difficult to minimize makespan in the global competitive markets. The purpose of this paper is to develop a decision support system to assist managers in making decisions for minimal makespan. There are too many and complex factors for senior managers to make suitable decisions. By traditional methods to allocate orders for minimum makespan, it often ma...

This paper investigates the scheduling problems in which the job processing times do not remain constant but are increasing linear functions of their starting times. Two deteriorating scheduling models, Model 1 and Model 2, for multiple machines are considered, with the goal being to minimize the makespan. In this paper, we propose an efficient heuristic for Model 1 and prove that the ratio of ...

We study methods for the exact solution of unrelated parallel machine problem with makespan minimization, generally denoted as R||C max . Our original application arises from automotive assembly process where tasks needs to be distributed among several robots. This involves solutions instances, which proved hard a MILP solver since objective induces weak LP relaxation bounds. To improve these b...

In this paper we analyze the robustness of 20 static, makespan-centric, DAG scheduling heuristics of the literature. We also study if dynamically changing the order of the tasks on their assigned processor improves the robustness. Based on experimental results we investigate how robustness and makespan are correlated. Finally, the heuristics are experimentally evaluated and ranked according to ...

We consider some special cases of the NP -hard resource-constrained project scheduling problem (RCPSP ) to minimize the makespan. We conjecture that the ratio of the optimal makespan of RCPSP to that of the preemptive version of the problem is less than 2. We show that a well-known lower bounds for the problem may yield bad approximation ratios or its calculation is an NP -hard problem too. We ...

The parallel machine scheduling problem has been a popular topic for many years due to its theoretical and practical importance. This paper addresses the robust makespan optimization on unrelated with sequence-dependent setup times, where processing times are uncertain, only knowledge is time intervals they take values from. We propose model min-max regret criterion formulate this problem. To s...

In hierarchical reliable multicast environment, makespan is the time that is required to fully and successfully transmit a packet from the sender to all receivers. Low makespan is vital for achieving high throughput with a TCP-like window based sending scheme. In hierarchical reliable multicast methods, the number of repair servers and their locations influence the makespan. In this paper we pr...

In this paper we consider the classical multiprocessor scheduling problem. In this problem, the goal is to assign a collection of tasks with different execution times to a set of machines so that the total load is balanced as evenly as possible across the machines. This objective is typically expressed as minimization of the makespan, or the load on the most heavily loaded machine. In general, ...