In most real-world applications, such as production and manufacturing processes, the underlying process distribution does not always follow a normal distribution. cases, statistical control literature recommends use of nonparametric (or distribution-free) charts. This paper introduces new distribution-free precedence chart using repetitive sampling. The performance proposed is investigated in t...

Abstract We consider a variant of the NP-hard problem assigning jobs to machines minimize completion time last job. Usually, precedence constraints are given by partial order on set jobs, and each job requires all its predecessors be completed before it can start. In this paper, we different type relation that has not been discussed as extensively is called OR-precedence. for start, require at ...

This paper considers the schedulability analysis of real-time distributed applications where tasks may present arbitrary precedence relations. It is assumed that tasks are periodic or sporadic and dynamically released. They have fixed priorities and hard end-to-end deadlines that are equal to or less than the respective period. We develop a method to transform arbitrary precedence relations int...

We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with arbitrary job weights, the special case of the problem where all job weights are one, and several other special cases of the problem all have the same approximability threshold with respect to polynomial time approximation alg...