A Modification of Particle Swarm

Optimization for
Resource Scheduling
Gohar Javed
14I-1407
Particle Swarm Optimization
A stochastic optimization technique
Modeled on the social behavior that is
observed in different species like birds and
insects.
Has been applied to a lot of problems such as
the travelling salesman problem, Flowshop
scheduling, job shop scheduling.
Topologies used in PSO
Different population topologies have been used
Ring
Star
Von Neumann
Random
Job Shop Scheduling
Is an optimization problem in which ideal jobs
are assigned to resources at particular times.
We are given n jobs J1, J2, ..., Jn of varying sizes,
which need to be scheduled on m identical
machines, while trying to minimize the
makespan.
The makespan is the total length of the schedule.
Job Scheduling contd
JSSP is a combinatorial and NP-hard problem.
NP-hard problems are a class of problems that
are "at least as hard as the hardest problems in
Non-deterministic Polynomial."
Proposed Approach
Is a hybrid approach for Job shop scheduling.
Uses ring topology as the population topology
and lbest to solve the job shop scheduling
problem using PSO.
Algorithm
All particles start at randomly assigned locations.
Personal best solution and best solution of
neighbor is used to calculate the new solution.
New speed and previous location are added to
create new solution
Asynchronous update method is used so that the
runtime load requirement is reduced.
Algorithm is terminated when set number of
particles finish the given number of iterations.
Details of the Proposed Approach
n = number of jobs
cost function = time taken to finish
computation