Subscribe Now Subscribe Today
Science Alert
 
FOLLOW US:     Facebook     Twitter
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2008 | Volume: 8 | Issue: 22 | Page No.: 4121-4128
DOI: 10.3923/jas.2008.4121.4128
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail
Solving Flow Shop Sequencing Problem for Deteriorating Jobs by Using Electro Magnetic Algorithm
H. Davoudpour and M. Hadji Molana

Abstract:
In the classical scheduling problems, processing time was assumed to be constant and takes predefined values. In many realistic environments, such as machine maintaining or crisis event management, processing time on each machine depends on the position of jobs on the machine sequence or their starting time on that machine. We assume that processing time was an increasing linear function of its start time, in other words pij = αijtij, in the literature these jobs were called deteriorating jobs. This problem addresses classic n\m\f\Cmax scheduling problem with a new assumption on the processing time of the jobs and it was surmised in the format of n\m\p,pij = αijtij\Cmax. We have used new Electro Magnetic meta-heuristic algorithm to find near optimum solution and compared the results with the results obtained from modified classical algorithms like CDS and Palmer.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

H. Davoudpour and M. Hadji Molana, 2008. Solving Flow Shop Sequencing Problem for Deteriorating Jobs by Using Electro Magnetic Algorithm. Journal of Applied Sciences, 8: 4121-4128.

DOI: 10.3923/jas.2008.4121.4128

URL: https://scialert.net/abstract/?doi=jas.2008.4121.4128

 
COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

       

       

Curve Bottom