VARIABLE NEIGHBORHOOD DESCENT<\/em> DENGAN KRITERIA MINIMASI STASIUN KERJA<\/span><\/strong><\/a><\/p>\r\n\r\n<\/span><\/strong><\/p>\r\n\u00a0<\/span><\/p>]]>","datatype":"http:\/\/www.w3.org\/1999\/02\/22-rdf-syntax-ns#XMLLiteral"}],"http:\/\/rdfs.org\/sioc\/ns#content":[{"type":"literal","value":"Penelitian ini membahas masalah keseimbangan lintasan perakitan sederhana tipe I (Single Assembly Line Balancing Problem I (SALBP I)) menggunakan algoritmaVariable Neigborhood Descent (VND) dengan kriteria minimisasi jumlah stasiun kerja. Algoritma VND terdiri dari dua tahap, yaitu tahap pembangkitan solusi inisial dan tahap local search. Solusi awal diperoleh dengan mengaplikasikan algoritma region approach yang kemudian diperbaiki dengan menggunakan neighborhood\/local-search seperti 1-0 insertion dan swap (1-1 interchange).Algoritma usulan diuji dengan menggunakan beberapa data set yang tedapat di literatur. skenario. Hasil pengujian menunjukkan bahwa algoritma usulan dapat menghasilkan solusi yang sama dengan solusi terbaik yang telah dipulikasikan.\r\nDibuat oleh :\u00a0 Arif Imran, Martino Luis, Danang Rahadian, Emsosfi Zaini\r\nE-mail:\u00a0 arifimr@yahoo.com\r\nKeterangan : \u00a0Makalah ini\u00a0 dimuat pada Jurnal Itenas Vol 16, No 1 (2012)\r\nMODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA\r\n\r\n\r\n\u00a0"}],"http:\/\/rdfs.org\/sioc\/ns#topic":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?cat=1"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?cat=5"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=algoritma-vnd"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=perakitan-sederhana"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=salbp"},{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=single-assembly-line-balancing-problem"}],"http:\/\/rdfs.org\/sioc\/ns#attachment":[{"type":"uri","value":"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2014\/01\/Paper-Itenas.pdf"}]},"https:\/\/lib.itenas.ac.id\/kti\/?author=6#account":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?author=6&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?cat=1":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?cat=1&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?cat=5":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?cat=5&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=algoritma-vnd":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=algoritma-vnd&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=perakitan-sederhana":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=perakitan-sederhana&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=salbp":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=salbp&feed=lhrdf&format=json"}]},"https:\/\/lib.itenas.ac.id\/kti\/?tag=single-assembly-line-balancing-problem":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?tag=single-assembly-line-balancing-problem&feed=lhrdf&format=json"}]},"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2014\/01\/Paper-Itenas.pdf":{"http:\/\/www.w3.org\/2000\/01\/rdf-schema#seeAlso":[{"type":"uri","value":"https:\/\/lib.itenas.ac.id\/kti\/?attachment_id=2487&feed=lhrdf&format=json"}]}}