in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...

Task graph scheduling is the important factor which occurs in the multiprocessor system. There is problem solving technique called NP complete which is the optimal scheduling of parallel tasks with some precedence relationship onto parallel machines and can be solved only by using heuristic approach. The execution time requirements of the applications tasks are assumed to be stochastic. Genetic...

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

Selecting the routes and the assignment of link flow in a computer communication networks are extremely complex combinatorial optimization problems. Metaheuristics, such as genetic or simulated annealing algorithms, are widely applicable heuristic optimization strategies that have shown encouraging results for a large number of difficult combinatorial optimization problems. This paper considers...

in this paper a scheduling problem in a 2-stage supply chain is discussed. suppliers are in the first stage and in the second stage, there are vehicles which carry orders to a manufacturing center. the purpose is to allocate orders to suppliers, sequence the suppliers’ production, allocate orders to transport vehicles and prioritize orders that should be carried by vehicles to minimize the tota...

In this paper, the effect of mathematical representation method of an MR damper on the performance of control algorithm is investigated. The most exact and common Maxwel Nonlinear Slider (MNS) and modified Bouc-Wen hysteretic models are employed through a nonlinear  comparatve numerical study. In many of semi-active control algorithms, a mathematical modelling method is required for determinig ...

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

In this paper, an approach to implement strategies for automated negotiations in electronic commerce applications is presented. It is based on genetic algorithms (GAs) that evolve FSMs (Finite State Machines). Each of these FSMs represents a negotiation strategy that competes against other strategies and is modified over time according to the outcome of this competition by using GA principles. ...