A δ-uniform BSS machine is a standard BSS machine which does not rely on exact equality tests. We prove that, for any real closed archimedean field R, a set is δ-uniformly semi-decidable iff it is open and semi-decidable by a BSS machine which is locally time bounded; we also prove that the local time bound condition is nontrivial. This entails a number of results about BSS machines, in particu...

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

Bandwidth-latency models are a group of performance models for parallel programs that focus on modeling the communication between the processes in terms of network bandwidth and latency, allowing quite precise performance estimations. While originally developed for distributed-memory architectures, these models also apply to machines with non-uniform memory access (NUMA), like the modern multi-...

We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.

In this paper, we consider the problem of scheduling n independent jobs on m uniform parallel machines such that total weighted completion time is minimized. We present two meta-heuristics and two hybrid meta-heuristics to solve this problem. Based on a set of instances, a comparative study has been realized in order to evaluate these approaches.

appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. one type of scheduling problems is just-in-time (jit) scheduling and in this area, motivated by jit manufacturing, this study investigates a mathematical model for...

This paper describes a new parallel kinematic architecture for machining applications: 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 machines (re...