A hybrid genetic algorithm (HGA) approach is proposed for a lot-streaming flow shop scheduling problem, in which a job (lot) is split into a number of smaller sublots so that successive operations can be overlapped. The objective is the minimization of the mean weighted absolute deviation of job completion t imes from due dates.

We study the minimum total weighted completion time problem on parallel machines, which is known to be strongly NP-hard. We develop general ideas leading to exponential neighborhoods in which the best improving neighbor can be determined by calculating a maximum weighted matching of an improvement graph. In a second step we introduce neighborhoods that form the base for the exponential neighbor...

Baker and Nuttle [1] studied the following single-variable-resource scheduling problem: sequencing n jobs for processing by a single resource to minimize a function of job completion times, when the availability of the resource varies over time. When the objective function to be minimized is the total weighted completion time, Baker and Nuttle conjectured that the problem is NP-hard. We show in...

This paper considers sequencing situations with due date criteria. Three di erent types of criteria are considered: the weighted penalty criterion, the weighted tardiness criterion and the completion time criterion. The main focus is on convexity of the associated cooperative games.

In this paper, we consider the entire mean weighted first-passage time (EMWFPT) with random walks on a family of weighted treelike networks. The EMWFPT on weighted networks is proposed for the first time in the literatures. The dominating terms of the EMWFPT obtained by the following two methods are coincident. On the one hand, using the construction algorithm, we calculate the receiving and se...

in the present paper, we introduce some new sequence spaces derived by riesz mean and the notions of almost and strongly almost convergence in a real 2-normed space. some topological properties of these spaces are investigated. further, new concepts of statistical convergence which will be called weighted almost statistical convergence, almost statistical convergence and statistical convergence...

the object of this paper is to establish a summability factor theorem for summabilitya, , k  1 k  where a is the lower triangular matrix with non-negative entries satisfying certain conditions.

we obtain sufficient conditions for the series σanλn to be absolutely summable of order k by atriangular matrix.

We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑ j Fj where Fj(Cj) corresponds to the cost of the completion of job j at time Cj . This class of function is very large and thus interesting both from a theoretical and practical point of vi...