We consider a m uniform parallel machines scheduling problem with two jobs A and B with nA and nB operations, respectively, and equal processing times. Job A is associated with a general cost function F, whereas makespan is considered for job B. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for F and C max criteria. We also tackle some part...

In this paper, a problem of scheduling tasks in uniform parallel machines with sequence-dependent setup times is presented. The problem under analysis contains a particular set of constraints, including equipment capacity, task precedences, lot sizing and task delivery plan. The complexity of the mathematical programming model developed for this problem hasn’t permitted to find one solution usi...

In a recent paper, Chekuri and Bender (Proceedings of IPCO’98, pp. 383–393) derive (among other results) a polynomial-time 6-approximation algorithm for makespan minimization on uniform parallel machines subject to chain-type precedence constraints. In this short note, we combine some straightforward observations and thereby derive an extremely simple 2-approximation algorithm for this problem....

Gardens integrates a programming language and system to support parallel computation over a network of workstations. Our goal is to develop extensions to Gardens allowing it to efficiently support clusters of SMP machines under a uniform programming model. Such support requires the implementation of high-performance shared memory message passing primitives as well as changes to the existing mod...

Scheduling has become an attractive area for artificial intelligence researchers. On other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. A maintenance program may be considered as the heath care of manufacturing machines and equipments...

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

Fundamental limits on the communication capabilities of massively parallel multiprocessors are investigated. It is shown that in the limit of machines of infinite extent in which the number of processors per unit volume is constant and in which the communication bandwidth from each processor to its neighbors depends only on their separation distance, interprocessor communication must fall off f...