Modifikasi Shifting Bottleneck Procedure dalam Masalah Penjadualan Job Shop  

Oleh:

Panggabean, Henry Pantas

Jenis: Article from Journal - ilmiah nasional
Dalam koleksi: Jurnal Teknologi Industri vol. 7 no. 2 (Apr. 2003), page 67-78.
Topik: Job-Shop Scheduling; Shifting Bottleneck Procedure; directed Graph Representation; Critical Path Method

Ketersediaan

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

Lihat Detail Induk

Isi artikel

Job-shop scheduling problem is one of the hardest np-complete combinatorial optimization problems. Shifting Bottleneck Problem (SBP) had been proved qualified in solving this problem with good solution and sinai! compulation time SBP decomposes job-shop scheduling problem into m one-machine scheduling problems, solves each with Garlier algorithm, and then combines one-machine schedules with some technique to form a job-shop schedule. The drawback of this method laid on its assumption that all jobs to be scheduled in one-machine is independent, in the contran’, some jobs in one-machine problems can be dependent during tile scheduling process, so that it is impossible to find optimal solution in that case, which in turn cause SBP to select an incorrect machine to schedule. This paper presents a modification to improve this drawback by utilizing a directed graph representation model and critical path method properly to hinder any cycle in job-shop schedule formation.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali