نتایج جستجو برای: facilities layout problems

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

Journal: :DEStech Transactions on Computer Science and Engineering 2017

Journal: :The International Conference on Applied Mechanics and Mechanical Engineering 1984

2011
Bin Wang William Lohry Song Zhang Hui Hu

Thin film flows naturally arise in a wide variety of industrial and environmental problems ranging from microchip manufacturing, structured packing to lava flows in geology. In particular, wind-driven flows of liquid films are of great interests for deeper understanding of aircraft icing and better design of anti-icing and de-icing strategies. Currently, most thickness mapping techniques involv...

Journal: :European Journal of Operational Research 2004
Ignacio Castillo Brett A. Peters

This paper develops a new mathematical model that integrates layout design and production planning to prescribe efficient multi-bay manufacturing facilities. The model addresses the need to distribute department replicas throughout the facility and extends the use of product and process requirements as problem parameters in order to increase process routing flexibility. In addition, the model a...

Journal: :Comp. Opt. and Appl. 2013
Philipp Hungerländer Franz Rendl

The single-row facility layout problem (SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. (SRFLP) is the one-dimensional version of the facility layout problem that seeks to arrange rectangular facilities so as to minimize the ove...

Journal: :The Institution of Civil Engineers Engineering Division Papers 1945

In traditional scheduling literature, it is generally assumed that the location of facilities are predetermined and fixed in advance. However, these decisions are interrelated and may impact each other significantly. Therefore finding a schedule and facility location has become an important problem as an extension of the well-known scheduling problems. In this research we consider joint decisio...

1999
Camil Demetrescu Giuseppe Di Battista Irene Finocchi Giuseppe Liotta Maurizio Patrignani Maurizio Pizzonia

We study the problem of designing layout facilities for the navigation of an “infinite” graph, i.e. a graph that is so large that its visualization is unfeasible, even by gluing together all the screen snapshots that a user can take during the navigation. We propose a framework for designing layout facilities that support the navigation of an infinite tree. The framework allows to exploit the k...

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

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