In this paper, we investigate some methods to solve one of the multi-criteria machine
scheduling problems. The discussed problem is the total completion time and the total …

In this paper we investigate the use of two types of local search methods (LSM), the
Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems() …

A traffic light control module base on PSO algorithm has been presented to find the optimal
set of adjacent streets that are the candidate to take the green period time providing the best …

The Machine Scheduling Problem (MSP) has a number of recognized exact and
approximation solution methods: Branch and Bound (BAB) method, Dynamic Programming …

The multicriteria single machine model is presented in this paper. We consider the machine
scheduling problem (MSP) of n jobs on a single machine minimize a function of tricriteria …

Particle swarm optimization (PSO) based cryptanalysis has acquired much attention
because it has a fast convergence rate. This paper investigates the use of a new approach …

In this paper we will investigate some Heuristic methods to solve travelling salesman
problem. The discussed methods are Minimizing Distance Method (MDM), Branch and …

In this paper, we suggest a multi-objective Machine Scheduling Problem (MSP). The
discussed problem is the sum of total completion time, total tardiness, total earliness time …

In this paper, we found some methods for solving one of the bicriteria machine scheduling
problems (BMSP). Our discussed problem is represented by the total completion and the …

Particle swarm optimization (PSO) based cryptanalysis has acquired much attention
because it has fast convergence rate. We investigate the use of Modify Particle Swarm …