Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   SCIENTIA IRANICA   2014 , Volume 21 , Number 3 (TRANSACTIONS E: INDUSTRIAL ENGINEERING); Page(s) 1021 To 1033.
 
Paper: 

A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR EXIBLE ASSEMBLY JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES

 
 
Author(s):  NOURALI S.*, IMANIPOUR N.
 
* FACULTY OF MANAGEMENT AND ACCOUNTING, DEPARTMENT OF INDUSTRIAL MANAGEMENT, ISLAMIC AZAD UNIVERSITY, SOUTH TEHRAN BRANCH, TEHRAN, IRAN
 
Abstract: 

This paper considers a exible assembly job shop scheduling problem with sequence dependent setup times, and its objective is the minimization of makespan, which integrates the process planning and scheduling activities. This is a combinatorial optimization problem with substantially large solution space, suggestingthat it is highly di cult to nd the best solution with the exact search method. In this paper, a particle swarm optimization based algorithm is proposed, which applies a novel solution representation method to t the continuous nature of the algorithm in the discrete modeled problem. Numerical experiments also have been performed to demonstrate the eectiveness of the proposed algorithm.

 
Keyword(s): FLEXIBLE JOB SHOP SCHEDULING, ASSEMBLY, SEQUENCE DEPENDENT SETUP TIME, PARTICLE SWARM OPTIMIZATION
 
References: 
  • ندارد
 
  pdf-File tarjomyar Yearly Visit 100
 
Latest on Blog
Enter SID Blog