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

Quality of service (QoS) is an important issue in the design and management of web service composition. QoS in web services consists of various non-functional factors, such as execution cost, execution time, availability, successful execution rate, and security. In recent years, the number of available web services has proliferated, and then offered the same services increasingly. The same web ...

This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics for an arbitrary performance criteria. The applied scheduling technique is priority scheduling, where the next state of the system is determined based on priority values of certain system elements. Genetic programming is used to create the priority function which, coupled with an appropriate...

This paper deals with two-processor scheduling for a class of program nets, that are acyclic and SWITCH-less, and of which each node has unity node firing time. Firstly, we introduce a hybrid priority list L∗ that generates optimal schedules for the nets whose AND-nodes possess at most single input edge. Then we extend L∗ to suit for general program nets to give a new priority list L∗∗. Finally...

In this paper, an algorithm based on particle swarm optimization is proposed, for hybrid flow shop scheduling problem, to minimize the makespan. First an effective new approach using two decisions based on parallel priority dispatching rules is applied. Next we develop an hybridizing DPSO, that presents new components to updating velocity and position using genetic operators, with an adaptive n...

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...