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 ...

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, ...

In a hierarchical reliable multicast (HRM) 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 HRM methods, the number of repair servers and their locations influence the makespan. In this paper we propose a new method t...

This paper presents a bottleneck-based methodology to solve scheduling problem of M1,M2,M3,M4,M3,M4 re-entrant flow shop where M1 and M4 have high tendency of being the dominant machines. Two generalised makespan algorithms using bottleneck approach were developed for the identified bottleneck. Each algorithm has specific correction factor which was used to ensure the accuracy of the makespan c...

This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for suc...

A number of identical machines operating in parallel are to be used to complete the processing of a collection of jobs so as to minimize either the jobs' makespan or flowtime. The total processing required to complete each job has the same probability distribution, but some jobs may have received differing amounts of processing prior to the start. When the distribution has a monotone hazard rat...

Makespan minimization in tasks scheduling of infrastructure as a service (IaaS) cloud is an NP-hard problem. A number of techniques had been used in the past to optimize the makespan time of scheduled tasks in IaaS cloud, which is propotional to the execution cost billed to customers. In this paper, we proposed a League Championship Algorithm (LCA) based makespan time minimization scheduling te...

The problem of makespan optimal solving of cooperative path finding (CPF) is addressed in this paper. The task in CPF is to relocate a group of agents in a non-colliding way so that each agent eventually reaches its goal location from the given initial location. The abstraction adopted in this work assumes that agents are discrete items moving in an undirected graph by traversing edges. Makespa...