Penjadualan Produksi Dengan Modifikasi Aplikasi Algoritma Campbell, Dudek, Smith (Studi Kasus di PT. Kimia Farma, Tbk)  

Oleh:

Rumanti, Augustina Asih

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI - atma jaya
Dalam koleksi: Metris: Jurnal Mesin, Elektro, Industri dan Sains vol. 6 no. 3 (Sep. 2005), page 190-202.
Topik: production; Production scheduling; flowshop; CDS Algorithm; makespan; Johnson Algorithm
Fulltext: hal 190-202.pdf (1.07MB)

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: MM42 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

This research, is done by case study in PT. Kimia Farma, Tbk. This Company conduct activity produksinya by flowshop layout, with four production line, and also the way of production most is make to order. Although there method make to stock in small scale. Often times the order accepted own brief due date, so that needed way of to minimize makespan to each, every existing production line. On that account to can overcome and or lesson negative impact from the problems, is hence needed a new algorithm which in it join algorithm Johnson algorithm Campbell and, Dudek, Smith ( CDS). Thereby will be yielded by sequence job of each production line with value makespan minimum. After application algorithm at one of case in shop floor on that company ( to five product type by due date of each product is of equal) hence obtained result as : Production Line I makespan minimum is 83 minute, Production Line II makespan minimum is 83 minute, Production Line III makespan minimum is 83 minute, roduction Line IV makespan minimum is 82.5 minute.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali