The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...

Given a set S = {P1, . . . , Pn} of n points in R, the depth δ(Q) of a point Q ∈ R is the minimum number of points of S that must be in a closed halfspace containing Q. A high depth point is a point whose depth is at least maxi [δ(Pi)]. For dimension d = 2 we give a simple, easily implementable O(n(log n)) deterministic algorithm to compute a high depth point and we give an Ω(n log n) lower bou...

The Dendritic Cell Algorithm is an immune-inspired algorithm originally based on the function of natural dendritic cells. The original instantiation of the algorithm is a highly stochastic algorithm. While the performance of the algorithm is good when applied to large real-time datasets, it is difficult to analyse due to the number of random-based elements. In this paper a deterministic version...

in this paper a non linear integrated fuzzy multi-objective production planning model with the labor learning and machines deterioration effects is presented. the objective function consists of two quantitative objectives namely increase profits and reduces the cost of system failure and a qualitative objective namely increases the satisfaction rate of the customers. different weights for objec...

The perceptron algorithm is a simple iterative procedure for finding a point in a convex cone F . At each iteration, the algorithm only involves a query to a separation oracle for F and a simple update on a trial solution. The perceptron algorithm is guaranteed to find a point in F after O(1/τ F ) iterations, where τF is the width of the cone F . We propose a version of the perceptron algorithm...

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...