{"id":2486,"date":"2014-01-22T01:23:32","date_gmt":"2014-01-22T01:23:32","guid":{"rendered":"http:\/\/lib.itenas.ac.id\/kti\/?p=2486"},"modified":"2014-04-11T01:42:54","modified_gmt":"2014-04-11T01:42:54","slug":"model-keseimbangan-lintas-perakitan-menggunakan-algoritma-variable-neighborhood-descent-dengan-kriteria-minimasi-stasiun-kerja","status":"publish","type":"post","link":"https:\/\/lib.itenas.ac.id\/kti\/?p=2486","title":{"rendered":"MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA"},"content":{"rendered":"<p style=\"text-align: justify;\">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.<\/p>\n<p style=\"text-align: justify;\">Dibuat oleh :\u00a0 Arif Imran, Martino Luis, Danang Rahadian, Emsosfi Zaini<\/p>\n<p style=\"text-align: justify;\">E-mail:\u00a0 arifimr@yahoo.com<\/p>\n<p style=\"text-align: justify;\">Keterangan : \u00a0Makalah ini\u00a0 dimuat pada Jurnal Itenas <a href=\"http:\/\/jurnalonline.itenas.ac.id\/index.php\/rekayasa\/issue\/view\/108\" target=\"_parent\">Vol 16, No 1 (2012)<\/a><\/p>\n<p class=\"MsoNormal\" style=\"margin-bottom: 0.0001pt; text-align: justify;\"><a href=\"http:\/\/jurnalonline.itenas.ac.id\/index.php\/rekayasa\/article\/view\/378\"><strong style=\"mso-bidi-font-weight: normal;\"><span style=\"font-size: 12.0pt; line-height: 115%; font-family: 'Times New Roman','serif';\" lang=\"IN\">MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA <em style=\"mso-bidi-font-style: normal;\">VARIABLE NEIGHBORHOOD DESCENT<\/em> DENGAN KRITERIA MINIMASI STASIUN KERJA<\/span><\/strong><\/a><\/p>\n<p class=\"MsoNormal\" style=\"margin-bottom: 0.0001pt; text-align: justify;\" align=\"center\"><strong style=\"mso-bidi-font-weight: normal;\"><span style=\"font-size: 12.0pt; line-height: 115%; font-family: 'Times New Roman','serif';\" lang=\"IN\"><br \/>\n<\/span><\/strong><\/p>\n<p class=\"MsoNormal\" style=\"text-align: justify;\" align=\"center\"><span lang=\"IN\">\u00a0<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 [&hellip;]<\/p>\n","protected":false},"author":6,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,5],"tags":[1254,1251,1253,1252],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA - Karya Tulis Ilmiah Itenas<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"http:\/\/lib.itenas.ac.id\/kti\/?p=2486\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA - Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"og:description\" content=\"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 [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"http:\/\/lib.itenas.ac.id\/kti\/?p=2486\" \/>\n<meta property=\"og:site_name\" content=\"Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"article:published_time\" content=\"2014-01-22T01:23:32+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2014-04-11T01:42:54+00:00\" \/>\n<meta name=\"author\" content=\"Asep Kamaludin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Asep Kamaludin\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"http:\/\/lib.itenas.ac.id\/kti\/?p=2486\",\"url\":\"http:\/\/lib.itenas.ac.id\/kti\/?p=2486\",\"name\":\"MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA - Karya Tulis Ilmiah Itenas\",\"isPartOf\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#website\"},\"datePublished\":\"2014-01-22T01:23:32+00:00\",\"dateModified\":\"2014-04-11T01:42:54+00:00\",\"author\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9\"},\"breadcrumb\":{\"@id\":\"http:\/\/lib.itenas.ac.id\/kti\/?p=2486#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"http:\/\/lib.itenas.ac.id\/kti\/?p=2486\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"http:\/\/lib.itenas.ac.id\/kti\/?p=2486#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/lib.itenas.ac.id\/kti\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#website\",\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/\",\"name\":\"Karya Tulis Ilmiah Itenas\",\"description\":\"Karya Tulis Ilmiah Itenas\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/lib.itenas.ac.id\/kti\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9\",\"name\":\"Asep Kamaludin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/f3fff432f1af1e74180f39e33a202251?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/f3fff432f1af1e74180f39e33a202251?s=96&d=mm&r=g\",\"caption\":\"Asep Kamaludin\"},\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/?author=6\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA - Karya Tulis Ilmiah Itenas","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"http:\/\/lib.itenas.ac.id\/kti\/?p=2486","og_locale":"en_US","og_type":"article","og_title":"MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA - Karya Tulis Ilmiah Itenas","og_description":"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 [&hellip;]","og_url":"http:\/\/lib.itenas.ac.id\/kti\/?p=2486","og_site_name":"Karya Tulis Ilmiah Itenas","article_published_time":"2014-01-22T01:23:32+00:00","article_modified_time":"2014-04-11T01:42:54+00:00","author":"Asep Kamaludin","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Asep Kamaludin","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"http:\/\/lib.itenas.ac.id\/kti\/?p=2486","url":"http:\/\/lib.itenas.ac.id\/kti\/?p=2486","name":"MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA - Karya Tulis Ilmiah Itenas","isPartOf":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#website"},"datePublished":"2014-01-22T01:23:32+00:00","dateModified":"2014-04-11T01:42:54+00:00","author":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9"},"breadcrumb":{"@id":"http:\/\/lib.itenas.ac.id\/kti\/?p=2486#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["http:\/\/lib.itenas.ac.id\/kti\/?p=2486"]}]},{"@type":"BreadcrumbList","@id":"http:\/\/lib.itenas.ac.id\/kti\/?p=2486#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/lib.itenas.ac.id\/kti"},{"@type":"ListItem","position":2,"name":"MODEL KESEIMBANGAN LINTAS PERAKITAN MENGGUNAKAN ALGORITMA VARIABLE NEIGHBORHOOD DESCENT DENGAN KRITERIA MINIMASI STASIUN KERJA"}]},{"@type":"WebSite","@id":"https:\/\/lib.itenas.ac.id\/kti\/#website","url":"https:\/\/lib.itenas.ac.id\/kti\/","name":"Karya Tulis Ilmiah Itenas","description":"Karya Tulis Ilmiah Itenas","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/lib.itenas.ac.id\/kti\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/f3b1ab90b912c959a933991c65c59fc9","name":"Asep Kamaludin","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/f3fff432f1af1e74180f39e33a202251?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/f3fff432f1af1e74180f39e33a202251?s=96&d=mm&r=g","caption":"Asep Kamaludin"},"url":"https:\/\/lib.itenas.ac.id\/kti\/?author=6"}]}},"views":747,"_links":{"self":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2486"}],"collection":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2486"}],"version-history":[{"count":7,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2486\/revisions"}],"predecessor-version":[{"id":2489,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/2486\/revisions\/2489"}],"wp:attachment":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2486"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2486"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2486"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}