this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...

We derive a lower bound for the sample complexity of the Sample Average Approximation method for a certain class of multistage stochastic optimization problems. In previous works, upper bounds for such problems were derived. We show that the dependence of the lower bound with respect to the complexity parameters and the problem's data are comparable to the upper bound's estimates. Like previous...

This paper presents a method of searching for the shortest route via the most designated points with the length not exceeding the preset upper bound. The proposed algorithm can obtain the quasi-optimum route efficiently and its effectiveness is verified by applying the algorithm to the actual map data. key words: routing, genetic algorithm, designated points, upper bound constraint, building bl...

Pudlák shows that bounded arithmetic (Buss’ S2) proves an upper bound on the Ramsey number Rr(k) (the r refers to the number of colors, assigned to edges; the k refers to the size of the monochromatic set). We will strengthen this result by improving the bound. We also investigate lower bounds, obtaining a non-constructive lower bound for the special case of 2 colors (i.e. r = 2), by formalizin...

Pudlák shows that bounded arithmetic (Buss’ S2) proves an upper bound on the Ramsey number Rr(k) (the r refers to the number of colors, assigned to edges; the k refers to the size of the monochromatic set). We will strengthen this result by improving the bound. We also investigate lower bounds, obtaining a non-constructive lower bound for the special case of 2 colors (i.e. r = 2), by formalizin...

Harry Buhrman et al gave an Ω( √ n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for some properties stronger lower bounds exist. We give an Ω(n3/2) bound for Graph Connectivity using Andris Ambainis’ method, and an O(n3/2 log n) upper bound based on Grover’s search algorithm. In addition we study the adjac...

This paper presents an exact solution method based on a new linearization scheme for the 0-1 Quadratic Knapsack Problem (QKP) which consists of maximizing a quadratic pseudo-Boolean function with non negative coefficients subject to a linear capacity constraint. Contrasting to traditional linearization schemes, our approach only adds one extra variable. We first convert (QKP) into an equivalent...

It has been proven by the authors that both the upper and lower bounds in energy norm of the exact solution to elasticity problems can now be obtained by using the fully compatible finite element method (FEM) and linearly conforming point interpolation method (LC-PIM). This paper examines the upper bound property of the linearly conforming radial point interpolation method (LC-RPIM), where the ...

in forging design the significant parameters are maximum load or energy which are required for the selection of forging press or hammer. these two parameters are varied by the other paramelers such as the geometry of die cavity, flash dimensions, shape of the work piece, friction, mechanical properties of the metal to be forged, temperature, strain rate, and number of the forging operation. the...

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