返回
Dynamic facility layout problem based on open queuing network theory
DOI:10.1016/j.ejor.2016.11.011.png)
摘要
En 中文
Determining the location of machines for given periods of time, depending on changes in the material flow between the machines, is known in the literature as a dynamic facility layout problem (DFLP). While most approaches focus on reducing handling and rearrangement costs, this article also considers the amount of work-in-process (WIP) for a particular class of problems. WIP results from the queuing phenomenon and depends on the availability of transportation units. To solve these types of problems, we suggest the use of an analytical approach which uses open queuing network theory and is based on a quadratic assignment problem formulation. Since a queuing model approximates the studied system, the accuracy of the results is evaluated through a comparison with simulation results. Considering both the NP-hardness and the multi-objective nature of the problem, a meta-heuristic optimization approach is proposed. It aims at determining the Pareto front using cloud-based multi-objective simulated annealing (C-MOSA). The performance of C-MOSA is evaluated against other published multi-objective approaches. Computational experiments are performed and the results show that C-MOSA is capable of obtaining efficient results to solve the multi-objective dynamic facility layout problem. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Manufacturing
Facility layout
Multi-objective optimization
Open queuing networks
Cloud-based simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
A nested semi-open queuing network model for analyzing dine-in restaurant performance用于分析餐厅绩效的嵌套半开放排队网络模型
Handling qualitative aspects in Unequal Area Facility Layout Problem: An Interactive Genetic Algorithm处理不等面积设施布局问题中的定性方面: 交互式遗传算法

