Dynamic Modified Spanning Tree Algorithm For Single-Row Dynamic Facility Layout Problem  

Oleh:

Yogaswara, Yogi

Jenis: Article from Proceeding
Dalam koleksi: Proceeding The 7th International Seminar on Industrial Engineering and Management (7th ISIEM) di Bali, March 11th – 13th, 2014, page PS 90-99.
Topik: Dynamic Facility Layout; single-row; rearrangement cost; material handling cost; time window
Fulltext: Paper 74 Yogi Yogaswara Pasundan University.pdf (260.65KB)

Isi artikel

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

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali