نتایج جستجو برای: facility layout design

تعداد نتایج: 1024141  

2013
R. M. A. SILVA

This paper proposes a mathematical formulation for the facility layout problem (FLP) based on the generalized quadratic assignment problem (GQAP). The GQAP is a generalization of the NP-hard quadratic assignment problem (QAP) that allows multiple facilities to be assigned to a single location as long as the capacity of the location allows. As a case study, we adapt the GRASP with path-relinking...

Journal: :Engineering Optimization 2002

1997
Saifallah Benjaafar Mehdi Sheikhzadeh

In this paper, we address the problem of designing flexible plant layouts for manufacturing facilities where product demands are subject to variability. A flexible layout is one that maintains low material handling costs despite fluctuations in the product demand levels. We extend existing procedures for design of flexible layouts by (1) explicitly capturing the stochastic nature of product dem...

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C 2004

Journal: :Applied Bionics and Biomechanics 2005

Journal: :Acta Mechanica Slovaca 2022

The article deals with the design of an educational training device for solving control systems regulating water level in reservoir. system allows several options operation different algorithms. can be connected to practical activities process.

Journal: :Journal of Applied Mathematics and Computational Mechanics 2017

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C 1983

2007
Terushige Honiden

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between f...

2005
JOSÉ TAVARES

Real world optimization problems are typically complex and difficult to solve. In this work it is intended to address these problems through a combination of two techniques: Constraint Logic Programming (CLP) and Genetic Algorithms (GA). This approach aims to benefit, on the one hand, from the easiness and naturalness of the CLP to express problems whose formulation is based on constraints, and...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید