Skip to content
18 September 2009 / Jeffrey Hermanto Halimsetiawan

Dynamic Programming Case : Assembly-line Scheduling using Java 2D


Tugas Perancangan dan Analisa Algoritma Lanjut :

Gambaran Singkat :

• Dua assembly lines, yaitu : line 1 and line 2
• Setiap line memiliki n stations
• Station j pada line i adalah Sij
• Waktu assembly pada Sij adalah aij
• Line i memiliki entry time ei and exit time xi
• Waktu untuk bertukar line setelah station Sij adalah tij

Formula Rekursi :

f1[j] = e1 + a1,1 if j = 1
f1[j] = min {f1[j − 1] + a1,j , f2[j − 1] + a1,j + t2,j−1} if j > 1
f2[j] = e2 + a2,1 if j = 1
f2[j] = min {f2[j − 1] + a2,j , f1[j − 1] + a2,j + t1,j−1} if j > 1
f* = min {f1[n] + x1, f2[n] + x2}

Input :

9 -> n station
2 4 -> entry time 1 & 2
7 9 3 4 8 4 12 6 4 ->  time a1,1..9
8 5 6 4 5 7 3 13 7 ->  time a2,1..9
3 2 -> exit time 1 & 2
2 3 1 3 4 1 2 3 ->  time t1,1..9
2 1 2 2 1 4 1 2 ->  time t2,1..9

Screenshot Animation Assembly-line Scheduling :

AssemblyLineScheduling9

AssemblyLineScheduling9

Tinggalkan Balasan

Isikan data di bawah atau klik salah satu ikon untuk log in:

Logo WordPress.com

You are commenting using your WordPress.com account. Logout / Ubah )

Gambar Twitter

You are commenting using your Twitter account. Logout / Ubah )

Foto Facebook

You are commenting using your Facebook account. Logout / Ubah )

Foto Google+

You are commenting using your Google+ account. Logout / Ubah )

Connecting to %s

%d blogger menyukai ini: