DYNAMIC MODIFIED SPANNING TREE ALGORITHM FOR SINGLE-ROW DYNAMIC FACILITY LAYOUT PROBLEM

Yogi Yogaswara, DS (2014) DYNAMIC MODIFIED SPANNING TREE ALGORITHM FOR SINGLE-ROW DYNAMIC FACILITY LAYOUT PROBLEM. Proceeding, International Seminar on Industrial Engineering and Management, 2014 (7). pp. 90-99. ISSN 1978-774X

Preview	Text Paper 74 Yogi Yogaswara Pasundan University.pdf Download (266kB) | Preview
Preview	Text Table of content.pdf Download (794kB) | Preview
Preview	Text Cover proceeding.pdf Download (9MB) | Preview

Abstract

Changes that occur as a result of costumized product or product mix will result in frequent changes in the process flow of each product that will ultimately change the layout. Thereby in future periods activity redesigning existing layout is a must and will become more frequent. Dynamic facility layout is the right choice to accommodate the changes that occurred to make a trade off between the rearrangement cost and material handling cost. This paper discusses an algorithm developed for single-row dynamic facility layout. Test results using some hypothetical scenarios of data shows the algorithm has a better performance for determining the time window length and the resulting total cost. Keywords : Dynamic Facility Layout, single-row, rearrangement cost, material handling cost, time window.

Item Type:	Article
Subjects:	RESEARCH REPORT
Divisions:	Fakultas Teknik > Teknik Industri 2014
Depositing User:	Irwan Kustiawan
Date Deposited:	20 May 2016 06:43
Last Modified:	20 May 2016 06:43
URI:	http://repository.unpas.ac.id/id/eprint/3753

Actions (login required)

View Item