in this paper, a multi-product continues review inventory control problem within batch arrival queuing approach (mqr/m/1) is modeled to find the optimal quantities of maximum inventory. the objective function is to minimize summation of ordering, holding and shortage costs under warehouse space, service level, and expected lost-sales shortage cost constraints from retailer and warehouse viewpoi...

This paper proposes a new algorithm of a simulated annealing (SA): Parallel Simulated Annealing using Genetic Crossover (PSA/GAc). The proposed algorithm consists of several processes, and in each process SA is operated. The genetic crossover is used to exchange information between solutions at fixed intervals. While SA requires high computational costs, particularly in continuous problems, thi...

The problem of multiprocessor scheduling can be stated as scheduling a general task graph on a multiprocessor system such that a set of performance criteria will be optimized. This study investigates the use of near optimal scheduling strategies in multiprocessor scheduling problem. The multiprocessor scheduling problem is modeled and simulated using five different simulated annealing algorithm...

In this work, we propose a Hybrid particle swarm optimization-Simulated annealing algorithm and present a comparison with i) Simulated annealing algorithm and ii) Back propagation algorithm for training neural networks. These neural networks were then tested on a classification task. In particle swarm optimization behaviour of a particle is influenced by the experiential knowledge of the partic...

this paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. first, the problem is formulated as a mixed integer linear programming model. then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. two experiments are carried out to evaluate th...

This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...