Paper Information

Journal:   JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS)   2016 , Volume 4 , Number 9 (SPECIAL ISSUE) #E0046; Page(s) 271 To 279.
 
Paper: 

SOLVING RE-ENTRANT NO-WAIT FLOW SHOP SCHEDULING PROBLEM

 
 
Author(s):  TASOUJI HASANPOUR S., AMIN NASERI M.R.*, ADRESSI A.
 
* DEPARTMENT OF INDUSTRIAL ENGINEERING, TARBIAT MODARES UNIVERSITY, TEHRAN, IRAN
 
Abstract: 

In this study we consider the production environment of re-entrant flow-shop (RFS) with the objective of minimizing make span of the jobs. In a RFS, at least one job should visit at least one of the machines more than once. In a nowait flow shop-scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting in the line of any machine until its processing is completed on the last one.
Integration of the properties of both of these environments, which is applied in many industries such as robotic industries, is not investigated separately. In the paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for the problem. First, we develop the mathematical model for the problem, and then we present the suggested algorithms. For small scale, results of GA and SA are compared to GAMS. For large-scale problems, results of GA and SA are compared to each other. Computational results show that both SA ad GA algorithms perform properly but totally, SA is likely to turn out well in finding better solutions especially in large-scale problems.

 
Keyword(s): RE-ENTRANT FLOW SHOP, NO-WAIT FLOW SHOP, GENETIC ALGORITHM, SIMULATED ANNEALING
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 35
 
Latest on Blog
Enter SID Blog