Pengembangan Penjadualan Job Shop Inserted Idle Time dengan Schedulling Graph untuk Meminimasi Biaya Tardiness & Earliness  

Oleh:

Dewi, Dian Retno Sari ; Maukar, Anastasia Lidya

Jenis: Article from Journal - ilmiah nasional
Dalam koleksi: Widya Teknik vol. 4 no. 2 (Nov. 2005), page 59-66.
Topik: job shop; backward; scheduling graph algorithm; insert idle time

Ketersediaan

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

Lihat Detail Induk

Isi artikel

This research develops job shop schedulling using a non-delay backward algorithm to minimize total earliness and tardiness costs. Backward approach has some disadvantages. For example, there is a possibility that the infeasible situation occurs, in which the job is scheduled at t < 0. Thus, the infeasible job (scheduled at t < 0) is forwarded till t = 0 using a non-delay backward algorithm by using Schedulling graph and Insert idle time. This job shop scheduling algorithm was validated using the LINDO software to check the effectiveness of heuristic method and to compare the results with the optimization method.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali