A two-level particle swarm optimisation algorithm for open-shop scheduling problem

2016 ◽  
Vol 7 (6) ◽  
pp. 575 ◽  
Author(s):  
Pisut Pongchairerks ◽  
Voratas Kachitvichyanukul
Keyword(s):  
Particle Swarm ◽  
Particle Swarm Optimisation ◽  
Open Shop ◽  
Scheduling Problem ◽  
Open Shop Scheduling ◽  
Shop Scheduling ◽  
Optimisation Algorithm ◽  
Particle Swarm Optimisation Algorithm

Using Improved Particle Swarm Optimization to Solve Open Shop Scheduling Problem with Two Criteria

2012 ◽  
Vol 433-440 ◽  
pp. 4936-4941
Author(s):  
Mohammad Reza Kabarazad Ghadim ◽  
Behnam Bahrami ◽  
Arash Bayat
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Open Shop ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Open Shop Scheduling ◽  
Swarm Optimization ◽  
Shop Scheduling

The shop-scheduling problem can be simply introduced as a problem of redistribution of resources or a problem of rearrangement of operation orders. Open shop scheduling problems (OSSP) are one of the most time-consuming works in scheduling problems. In other hand Optimization techniques have obtained much attention during the past decades. Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) are the most important methods used to solve optimization problems such as Open Shop Scheduling. In this paper, a hybrid optimization algorithm (IPSO) is proposed to solve Open Shop Scheduling more efficiently and accurately. Most literature referring to OSSP focuses on the optimization of one single objective.This paper offered a mathematic model for OSSP with the goal of minimizing average completion time and the number of late jobs simultaneously. The proposed method was then compared whit the results of the LINGO software and GA. The results of this comparison show that IPSO can achieve better results for the solution in a faster time. Introduction

Sign in / Sign up

Export Citation Format

Share Document