Volume 31, Issue 2 (IJIEPR 2020)                   IJIEPR 2020, 31(2): 269-285 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Ghadirpour M, Rahmani D, Moslemipour G. Routing flexibility for unequal–area stochastic dynamic facility layout problem in flexible manufacturing systems. IJIEPR 2020; 31 (2) :269-285
URL: http://ijiepr.iust.ac.ir/article-1-899-en.html
1- Department of Industrial Engineering, Payame Noor University, Iran
2- Department of Industrial Engineering, K. N. Toosi University of Technology, Iran , drahmani@kntu.ac.ir
Abstract:   (3819 Views)
It is indispensable that any manufacturing system is consistent with potential changes such as fluctuations in demand. The uncertainty also makes it more essential. Routing Flexibility (RF) is one of the necessities to any modern manufacturing system such as Flexible Manufacturing System (FMS). This paper suggests three mixed integer nonlinear programming models for the Unequal–Area Stochastic Dynamic Facility Layout Problems (UA–SDFLPs) by considering the Routing Flexibility. The models are proposed when the independent demands follow the random variable with the Poisson, Exponential, and Normal distributions. To validation of the proposed models, many small-sized test problems has solved that derived from a real case in literature. The large-sized test problems are solved by the Genetic Algorithm (GA) at a reasonable computational time. The obtained results indicate that the discussed models for the UA–SDFLPs are valid and the managers can take these models to the manufacturing floor to adapt to the potential changes in today's competitive market.
Full-Text [PDF 1026 kb]   (1676 Downloads)    
Type of Study: Research | Subject: Facilities Design & or Work Space Design
Received: 2019/05/13 | Accepted: 2020/04/20 | Published: 2020/06/27

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.