{"id":773,"date":"2012-04-12T02:34:40","date_gmt":"2012-04-12T02:34:40","guid":{"rendered":"http:\/\/lib.itenas.ac.id\/kti\/?p=773"},"modified":"2012-04-12T07:01:07","modified_gmt":"2012-04-12T07:01:07","slug":"job-shop-scheduling-problems-with-alternative-routings-using-variable-neighbourhood-descent-to-minimize-makespan","status":"publish","type":"post","link":"https:\/\/lib.itenas.ac.id\/kti\/?p=773","title":{"rendered":"Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan"},"content":{"rendered":"<p>This paper deals with a generalization of the classical job shop scheduling problem known as the flexible job shop sheduling problem (FJSP). A heuristic algorithm based on variable neighbourhood descent (VND) is put forward to tackle the problem such that the maximum completion time (makespan) of the schdule is minimised. The performance of this VND based approach is assessed using well known data sets from the literature. Some preliminary results are reported and very competitive results are also abtained when compared to the best known results from the literature.<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Di buat oleh:<\/strong> Arif Imran (arifimran@itenas.ac.id \/ arifimr@yahoo.com),\u00a0Martino Luis (luis@itenas.ac.id), Emsosfi Zaini (efi@itenas.ac.id), B. Beny (bny_511@yahoo.com).<br \/>\n<strong>Kata kunci :<\/strong> job shop, alternative routings, heuristics, makespan<br \/>\n<strong>Keterangan :<\/strong> Proceeding The International Conference on Industrial Engineering and Business Management 2010, Universitas Islam Negeri Sunan Kalijaga, ISBN : 978-602-97809-0-1.<\/p>\n<p>&nbsp;<\/p>\n<p><a href=\"http:\/\/lib.itenas.ac.id\/kti\/wp-content\/uploads\/2012\/04\/03.-Job-Shop-Scheduling-Problems-with-Alternative-Routings-using-Variable-...1.pdf\">Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>This paper deals with a generalization of the classical job shop scheduling problem known as the flexible job shop sheduling problem (FJSP). A heuristic algorithm based on variable neighbourhood descent (VND) is put forward to tackle the problem such that the maximum completion time (makespan) of the schdule is minimised. The performance of this VND [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,5],"tags":[320,321,319,322],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan - 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=\"https:\/\/lib.itenas.ac.id\/kti\/?p=773\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan - Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"og:description\" content=\"This paper deals with a generalization of the classical job shop scheduling problem known as the flexible job shop sheduling problem (FJSP). A heuristic algorithm based on variable neighbourhood descent (VND) is put forward to tackle the problem such that the maximum completion time (makespan) of the schdule is minimised. The performance of this VND [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/lib.itenas.ac.id\/kti\/?p=773\" \/>\n<meta property=\"og:site_name\" content=\"Karya Tulis Ilmiah Itenas\" \/>\n<meta property=\"article:published_time\" content=\"2012-04-12T02:34:40+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2012-04-12T07:01:07+00:00\" \/>\n<meta name=\"author\" content=\"bhakti\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"bhakti\" \/>\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\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=773\",\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=773\",\"name\":\"Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan - Karya Tulis Ilmiah Itenas\",\"isPartOf\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#website\"},\"datePublished\":\"2012-04-12T02:34:40+00:00\",\"dateModified\":\"2012-04-12T07:01:07+00:00\",\"author\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/c5a837ce04e34308ed2e7583a68ea8c4\"},\"breadcrumb\":{\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=773#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/lib.itenas.ac.id\/kti\/?p=773\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/?p=773#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/lib.itenas.ac.id\/kti\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan\"}]},{\"@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\/c5a837ce04e34308ed2e7583a68ea8c4\",\"name\":\"bhakti\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/ccecf4e038984a122fdacecaf647e3c0?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/ccecf4e038984a122fdacecaf647e3c0?s=96&d=mm&r=g\",\"caption\":\"bhakti\"},\"url\":\"https:\/\/lib.itenas.ac.id\/kti\/?author=2\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan - 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":"https:\/\/lib.itenas.ac.id\/kti\/?p=773","og_locale":"en_US","og_type":"article","og_title":"Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan - Karya Tulis Ilmiah Itenas","og_description":"This paper deals with a generalization of the classical job shop scheduling problem known as the flexible job shop sheduling problem (FJSP). A heuristic algorithm based on variable neighbourhood descent (VND) is put forward to tackle the problem such that the maximum completion time (makespan) of the schdule is minimised. The performance of this VND [&hellip;]","og_url":"https:\/\/lib.itenas.ac.id\/kti\/?p=773","og_site_name":"Karya Tulis Ilmiah Itenas","article_published_time":"2012-04-12T02:34:40+00:00","article_modified_time":"2012-04-12T07:01:07+00:00","author":"bhakti","twitter_card":"summary_large_image","twitter_misc":{"Written by":"bhakti","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=773","url":"https:\/\/lib.itenas.ac.id\/kti\/?p=773","name":"Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan - Karya Tulis Ilmiah Itenas","isPartOf":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#website"},"datePublished":"2012-04-12T02:34:40+00:00","dateModified":"2012-04-12T07:01:07+00:00","author":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/c5a837ce04e34308ed2e7583a68ea8c4"},"breadcrumb":{"@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=773#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/lib.itenas.ac.id\/kti\/?p=773"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/lib.itenas.ac.id\/kti\/?p=773#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/lib.itenas.ac.id\/kti"},{"@type":"ListItem","position":2,"name":"Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan"}]},{"@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\/c5a837ce04e34308ed2e7583a68ea8c4","name":"bhakti","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/lib.itenas.ac.id\/kti\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/ccecf4e038984a122fdacecaf647e3c0?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/ccecf4e038984a122fdacecaf647e3c0?s=96&d=mm&r=g","caption":"bhakti"},"url":"https:\/\/lib.itenas.ac.id\/kti\/?author=2"}]}},"views":983,"_links":{"self":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/773"}],"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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=773"}],"version-history":[{"count":4,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/773\/revisions"}],"predecessor-version":[{"id":784,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=\/wp\/v2\/posts\/773\/revisions\/784"}],"wp:attachment":[{"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=773"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=773"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lib.itenas.ac.id\/kti\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=773"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}