Heterogeneous computing (HC) systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be inaccuracies in the estimation of task execution times. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that needs to be optimized in such systems. Resource allocation is typically p...

Scheduling in Computational Grid (CG) is an important but complex task. It is done to schedule the submitted jobs onto the nodes of the grid so that some characteristic parameter is optimized. Makespan of the job is an important parameter and most often scheduling is done to optimize makespan. Genetic Algorithm (GA) is a search procedure based on the evolutionary technique that is able to solve...

We schedule the jobs from two agents on a single parallel-batching machine with equal processing time and non-identical job sizes. The objective is to minimize the makespan of the first agent subject to an upper bound on the makespan of the other agent. We show that there is no polynomial-time approximation algorithm for solving this problem with a finite worst-case ratio, unless P = NP. Then, ...

In this paper we confront the job shop scheduling problem with total flow time minimization. We start extending the disjunctive graph model used for makespan minimization to represent the version of the problem with total flow time minimization. Using this representation, we adapt local search neighborhood structures originally defined for makespan minimization. The proposed neighborhood struct...

A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan. Computational results indicate that the proposed algorithm is very competitive with respect to well-known constructive algorithms for a larg...

Single machine scheduling problems have been extensively studied in the literature under the assumption that all jobs have to be processed. However, in many practical cases, one may wish to reject the processing of some jobs in the shop, thus resulting in a rejection cost. In such a framework, the scheduler has to decide …rst which jobs will be rejected and which will be accepted. Then he has t...

In this paper we address the problem of makespan optimal sequencing in a ow shop with parallel machines (FSPM). This kind of production facility is a generalization of the standard ow shop where at least one stage consists of two or more identical machines. We present a branch & bound algorithm and its parallel implementation which minimizes the makespan, i. e. the maximum completion time requi...

The effect of workers’ learning curve on production rate in manual assembly lines is significant when producing relatively small batches of different products. This research analyzes this effect and suggests applying work-sharing among the workers in such an environment to improve the time to complete the batch, namely, the makespan. Work-sharing refers to a situation where adjacent workers hel...

This paper presents the development of an alternative method for makespan computation algorithms of a re-entrant flow shop scheduling problem using bottleneck analysis. The computation is specifically intended for the cyber manufacturing centre (CMC) which is an Internet based collaborative design and manufacturing services at Universiti Tun Hussein Onn Malaysia. The CMC processes scheduling re...