We consider the problem of scheduling unit-length jobs on identical machines subject to precedence constraints. We show that natural scheduling rules fail when the precedence constraints form a collection of stars or a collection of complete bipartite graphs. We prove that the problem is in fact NP-hard on collections of stars when the input is given in a compact encoding, whereas it can be sol...

In this paper, we present a technique that combines motion planning and part interaction clusters to improve generation of assembly precedence constraints. In particular, this technique automatically finds, and clusters, parts that can mutually affect each other’s accessibility, and hence may impose assembly constraints. This enables generation of accurate precedence constraints without needing...

In the Multiprocessor Scheduling with Precedence Constraints, we are given n-jobs denoted by {J1, J2, · · · , Jn}, the associated processing time pi, i = 1, · · · , n and m identical machines to which jobs are needed to be assigned. In addition, jobs have precedence constraints between them, and we use notation Jj ≺ Ji to imply that Ji cannot be done before completing Jj (the smaller runs earli...

Many scientific applications running in Cloud Computing system are workflow applications that contains large number of tasks and in which tasks are connected by precedence relations. Efficient scheduling the workflow tasks become a challenging issue in Cloud Computing environments because the scheduling decides performance of the applications. Unfortunately, finding the optimal scheduling is kn...

The scheduling of application tasks is a problem that occurs in all multiprocessor systems This problem becomes even more compli cated if the tasks are not independent but are interrelated by mutual exclusion and precedence constraints This paper presents an approach for pre runtime scheduling of periodic tasks on multiple processors for a real time system that must meet hard deadlines The task...

Resource-constrained project scheduling with generalised precedence constraints is a very general scheduling model with applications in areas such as make-to-order production planning. We describe a time-oriented branch-and-bound algorithm that uses constraint-propagation techniques which actively exploit the temporal and resource constraints of the problem in order to reduce the search space. ...

Constraint-based scheduling is a powerful tool for solving real-life scheduling problems thanks to a natural integration of special solving algorithms encoded in global constraints. The filtering algorithms behind these constraints are based on propagation rules modelling some aspects of the problems, for example a unary resource. This paper describes new incremental propagation rules integrati...

This paper presents a distributed algorithm for the partial precedence constrained scheduling problem. In the classical precedence constrained scheduling problem all the dependent tasks must be scheduled before the task itself can be scheduled. The partial precedence constrained scheduling problem is a generalized version of the original precedence constrained problem in the sense that the numb...

MOGA along with virtual deadline is capable of outperforming the Dynamic Window Constraint Scheduling(DWCS) by servicing jobs with different request periods .Additionally, MOGA with virtual deadline yields better results than Virtual Deadline Scheduling(VDS) because the context switching time is less in the former. Eventually, an implementation of MOGA with virtual deadline as a schedule parame...

energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...