Solution algorithms for scheduling flow-shop-type remanufacturing systems  

Oleh:

Kim, Min-Geun ; Yu, Jae-Min ; Lee, Dong-Ho

Jenis: Article from Proceeding
Dalam koleksi: The 14th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS), 3-6 December 2013 Cebu, Philippines, page 1-8.
Topik: remanufacturing systems; flow-shop-type reprocessing lines; operations scheduling; heuristics
Fulltext: 1278.pdf (337.06KB)

Isi artikel

We consider the scheduling problem in remanufacturing systems with a single disassembly workstation, parallel flow-shop-type reprocessing lines and a single reassembly workstation. End-of-use/life products are separated into their components at the disassembly workstation, and then each component is reprocessed at one of the flow-shop-type reprocessing lines. Finally, the reprocessed components are reassembled into the remanufactured products at the reassembly workstation. The problem is to determine the sequence of products to be disassembled, the sequence of components to be reprocessed at each reprocessing lines and the sequence of products to be reassembled. The objective is to minimize the total flow time. To represent the problem mathematically, an integer programming model is developed. Then, due to the complexity of the problem, we suggest two types of heuristics: (a) NEH based heuristic; and (b) priority scheduling heuristic. Computational experiments were done on various test instances, and the test results are reported.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali