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

Paper Information

Journal:   PRODUCTION AND OPERATIONS MANAGEMENT   SPRING-SUMMER 2016 , Volume 7 , Number 1 (12) ; Page(s) 65 To 81.
 
Paper: 

EFFICIENT ALGORITHMS FOR SOLVING FLEXIBLE FLOW SHOP SCHEDULING PROBLEM WITH UNRELATED PARALLEL MACHINES AND SEQUENCE-DEPENDENT SETUP TIMES CONSIDERING EARLINESS/TARDINESS MINIMIZATION

 
 
Author(s):  GHOLAMI SAIEDEH, RAJAEE ABYANEH FARZANEH
 
* 
 
Abstract: 

In this paper, a mixed integer programming formulation for flexible flow shop scheduling problem with unrelated machines and sequence dependent setup times is proposed in order to minimize sum of earliness and tardiness. Due to the fact that this problem is NP-Hard, a SA-based heuristic as well as a PSO-based heuristic are proposed to tackle the complexity of the problem. Later, the parameters of these algorithms are set by Taguchi method and then, these meta-heuristic algorithms are compared with each other by 410 test problems. At the end, a number of topics are proposed for future research.

 
Keyword(s): FLEXIBLE FLOW SHOP SCHEDULING PROBLEM, SEQUENCE DEPENDENT SETUP TIME, EARLINESS, TARDINESS, SIMULATED ANNEALING ALGORITHM, PARTICLE SWARM OPTIMIZATION ALGORITHM
 
 
References: 
  • ندارد
  •  
 
Click to Cite.
APA: Copy

GHOLAMI, S., & RAJAEE ABYANEH, F. (2016). EFFICIENT ALGORITHMS FOR SOLVING FLEXIBLE FLOW SHOP SCHEDULING PROBLEM WITH UNRELATED PARALLEL MACHINES AND SEQUENCE-DEPENDENT SETUP TIMES CONSIDERING EARLINESS/TARDINESS MINIMIZATION. PRODUCTION AND OPERATIONS MANAGEMENT, 7(1 (12) ), 65-81. https://www.sid.ir/en/journal/ViewPaper.aspx?id=570788



Vancouver: Copy

GHOLAMI SAIEDEH, RAJAEE ABYANEH FARZANEH. EFFICIENT ALGORITHMS FOR SOLVING FLEXIBLE FLOW SHOP SCHEDULING PROBLEM WITH UNRELATED PARALLEL MACHINES AND SEQUENCE-DEPENDENT SETUP TIMES CONSIDERING EARLINESS/TARDINESS MINIMIZATION. PRODUCTION AND OPERATIONS MANAGEMENT. 2016 [cited 2021May13];7(1 (12) ):65-81. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=570788



IEEE: Copy

GHOLAMI, S., RAJAEE ABYANEH, F., 2016. EFFICIENT ALGORITHMS FOR SOLVING FLEXIBLE FLOW SHOP SCHEDULING PROBLEM WITH UNRELATED PARALLEL MACHINES AND SEQUENCE-DEPENDENT SETUP TIMES CONSIDERING EARLINESS/TARDINESS MINIMIZATION. PRODUCTION AND OPERATIONS MANAGEMENT, [online] 7(1 (12) ), pp.65-81. Available: https://www.sid.ir/en/journal/ViewPaper.aspx?id=570788.



 
 
Yearly Visit 58 Persian Abstract
 
Latest on Blog
Enter SID Blog