This paper describes a new parallel kinematic architecture for machining applications, namely, the orthoglide. This machine features three fixed parallel linear joints which are mounted orthogonally and a mobile platform which moves in the Cartesian x-y-z space with fixed orientation. The main interest of the orthoglide is that it takes benefit from the advantages of the popular PPP serial mach...

We consider the problem of minimizing the makespan when scheduling tasks on two uniform parallel machines, where one machine is q times as efficient on each task as is the other. We compute the maximum relative error of the LPT (largest processing time first) heuristic as a function of q. In the special case that the two machines are identical (q = 1), our problem and heuristic are identical to...

This paper presents a general method to compact the rst-order part of functional languages with call-by-value semantics for ne-grain parallel machines like VLIW or super-scalars. This work extends previous works on compaction in two ways. First, it deenes a new formal system for the compaction problem usable to design a meta-compiler for these machines. Second, the compaction is directly applie...

This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

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

We prove an analogue of Brent’s lemma for BSP-like parallel machines featuring a hierarchical structure for both the interconnection and the memory. Specifically, for these machines we present a uniform scheme to simulate any computation designed for v processors on a v0-processor configuration with v0 v and the same overall memory size. For a wide class of computations the simulation exhibits ...

We present a system for functional parallel computing on distributed memory machines with dynamic load balancing and recovery. Every node can perform any computation and is client and server at the same time. The nodes themself are multithreaded to overlap communication with computation and minimize latency. Furthermore, the calling convention is similar to threads on shared memory machines to ...