OPTIMIZATION OF DISCRETE FACILITY LAYOUT WITH A CANDIDATE GROUPING APPROACH

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MIRI ALIASGHAR; RAZAVI HAMIDEH

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2018 | Volume:9 | Issue:1 (16) Page(s): 55-78

Download Full-Text

Persian Verion

View:

877

Download:

273

Cites:

Information Journal Paper

Title

OPTIMIZATION OF DISCRETE FACILITY LAYOUT WITH A CANDIDATE GROUPING APPROACH

Author(s)

MIRI ALIASGHAR | RAZAVI HAMIDEH | Issue Writer Certificate

Keywords

FACILITY LAYOUT PROBLEMQ2

OPTIMIZATIONQ2

CANDIDATE GROUPSQ1

MIX INTEGER LINEAR PROGRAMINGQ1

Abstract

FACILITY LAYOUT PROBLEM (FLP) is an important issue in plant design, which directly affects production costs as well as safety concerns. Hierarchical and integrated approaches are two main methods used for the formulation of FLP. In the hierarchical approach, FLP is solved after the completion of the process design and scheduling, while the integrated approach treats FLP simultaneously with other phases. This paper presents a new approach based on the CANDIDATE GROUPS for interactive functions; incorporating the advantages of the previous approaches.In the new approach, the design phases prior to FLP results in a set of models introducing by the engineering team in advance. Next, the models are solved such that instead of individual designs, a set of suggested structures are generated. These structures are then fed into the FLP as input data and solved by mixed integer programming technique. Some characteristics of the models are: presence of the hub stations, different and variable dimensions for each station, possibility of rotation for the stations and incorporating safety distances. Finally, test problems are solved and results are discussed. It should be noted that if a candidate group entails a different production flow then a different optimum solution might be obtained.

Cites

No record.

References

No record.

Cite

APA: Copy

MIRI, ALIASGHAR, & RAZAVI, HAMIDEH. (2018). OPTIMIZATION OF DISCRETE FACILITY LAYOUT WITH A CANDIDATE GROUPING APPROACH. PRODUCTION AND OPERATIONS MANAGEMENT, 9(1 (16) ), 55-78. SID. https://sid.ir/paper/217528/en

Vancouver: Copy

MIRI ALIASGHAR, RAZAVI HAMIDEH. OPTIMIZATION OF DISCRETE FACILITY LAYOUT WITH A CANDIDATE GROUPING APPROACH. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2018;9(1 (16) ):55-78. Available from: https://sid.ir/paper/217528/en

IEEE: Copy

ALIASGHAR MIRI, and HAMIDEH RAZAVI, “OPTIMIZATION OF DISCRETE FACILITY LAYOUT WITH A CANDIDATE GROUPING APPROACH,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 9, no. 1 (16) , pp. 55–78, 2018, [Online]. Available: https://sid.ir/paper/217528/en

Related Journal Papers