We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...

The theory of local homology modules was initiated by Matlis in 1974. It is a dual version of the theory of local cohomology modules. Mohammadi and Divaani-Aazar (2012) studied the connection between local homology and Gorenstein flat modules by using Gorenstein flat resolutions. In this paper, we introduce generalized local homology modules for complexes and we give several ways for computing ...

In this paper an efficient Algorithm based on Zadeh's extension principle has been investigated to approximate fuzzy solution of two-point fuzzy boundary value problems, with fuzzy boundary values. We use finite difference method in term of the upper bound and lower bound of $r$- level of fuzzy boundary values. The proposed approach gives a linear system with crisp tridiagonal coefficients matr...

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...

Here, we propose a method of estimation of the derivatives of probability density based wavelets methods for a sequence of m−dependent random variables with a common one-dimensional probability density function and obtain an upper bound on Lp-losses for the such estimators.

In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...