All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Facility Layout Problem with Logistic Constraints

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24210%2F22%3A00009973" target="_blank" >RIV/46747885:24210/22:00009973 - isvavai.cz</a>

  • Result on the web

    <a href="https://mme2022.vspj.cz/download/proceedings-4.pdf" target="_blank" >https://mme2022.vspj.cz/download/proceedings-4.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Facility Layout Problem with Logistic Constraints

  • Original language description

    The great pressure to maximise productivity and minimise logistics costs in manufacturing systems leads to the problem of efficient layout arrangement and logistics path planning. An efficient layout not only minimises product cost but also leads to greater customer satisfaction in the form of earlier delivery dates. This article aims to develop a constructive algorithm for the Facility Layout Problem of Flexible Manufacturing Systems with material handling. The model of this system consists of cells with unequal sizes oriented in an open field layout and connected with paths. Paths that use facility space create a logistic system between facility entrance and exit and production cells pick-up and drop-off points. Solution construction mainly consists of selecting a cell to be placed and a suitable free space where the cell can be oriented to fit area limitations and, at the same time to be connected to logistics paths. There are proposed dispatching rules to make decisions in the before-mentioned steps and tested on developed model instances. The key objective is to minimise material handling costs. However, an additional optimisation objective of potential free space for new cells is also discussed.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10100 - Mathematics

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    40TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS 2022

  • ISBN

    978-80-88064-62-6

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    180-186

  • Publisher name

    Coll Polytechnics Jihlava

  • Place of publication

    JIHLAVA

  • Event location

    Jihlava

  • Event date

    Jan 1, 2022

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    000936355000028