Management information system for printing machine assignment process with tabu search algorithm  

Oleh:

Sipayung, Evasaria M. ; Gunawan, Arief Samuel ; TEOFILUS

Jenis: Article from Proceeding
Dalam koleksi: PROCEEDING The 8th International Seminar on Industrial Engineering and Management (8th ISIEM). Atria Hotel & Conference, Malang, Indonesia March 17 – 19, 2015, page DSS-61.
Topik: tabu search; machine assignment; printing process
Fulltext: Paper 66 Evasaria M Sipayung - Harapan Bangsa Institute of Technology.pdf (658.89KB)

Isi artikel

Printing industry involved a sequence of processes involving various machines and work stations. One particular problem related to this is delays in fulfilling customer orders due to inefficient assignment of machines. Inappropriate sequence and assignment of jobs to the machines usually causes idle times in one hand and congested processes in the other hand. To overcome this problem, an assignment system in the form of an application will be developed using the tabu search method. The system will calculate the combination of optimal job completion time iteratively until the furthest value from the deadline of the job is obtained. It will generate assignment solutions for multiple jobs and machines simultaneously thus helping the management to make decision. Besides generating assignment solutions, the system will also provide with reports and feedbacks features, as well as flexible features when dealing with sudden or urgent jobs and overtimes.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali