EMAIL: PASSWORD:
Front Office
UPT. PERPUSTAKAAN
Institut Teknologi Sepuluh Nopember Surabaya


Kampus ITS Sukolilo - Surabaya 60111

Phone : 031-5921733 , 5923623
Fax : 031-5937774
E-mail : libits@its.ac.id
Website : http://library.its.ac.id

Support (Customer Service) :
timit_perpus@its.ac.id




Welcome..guys!

Have a problem with your access?
Please, contact our technical support below:
LIVE SUPPORT


Moh. Fandika Aqsa


Davi Wahyuni


Tondo Indra Nyata


Anis Wulandari


Ansi Aflacha




ITS » Master Theses » Teknik Informatika - S2
Posted by eny at 23/12/2006 10:38:32  •  30761 Views


OPTIMASI PERSOALAN PENJADWALAN BERTIPE JOB-SHOP DENGAN MENGGUNAKAN ALGORITMA EKSAK HEURISTIK BERDASARATURAN PRIORITAS SPT LPT LWR DAN MWR HEURISTIK BERBASIS GENETIK DAN HYBRID GENETIK

JOB-SHOP SCHEDULING PROBLEM OPTIMIZATION USING EXACT ALGORITHM HEURISTIC BASED PRIORITY RULE SPT LPT LWR and MWR HEURISTIC BASED GENETIC ALGORITHM AND HYBRID GENETIC

Author :
Badriyah, Tessy 




ABSTRAK

Persoalan penjadwalan bertipe Job-Shop JSSP merupakan persoalan optimasi kombinatorial yang tidak hanya tergolong NP-Complete tapi juga termasuk salah satu yang paling sulit dipecahkan. Dengan menggunakan Metode Heuristik tidak perlu dicoba semua kemungkinan untuk mendapatkan solusi optimal seperti yang dilakukan oleh Algoritma Eksak. Dengan Metode Heuristik dapat dihasilkan solusi baik yang mendekati solusi optimal. Selain itu Algoritma Genetik GA juga bisa menjadi salah satu alternatif karena telah banyak diketahui bahwa GA dapat memberikan solusi mendekati solusi optimal. GA secara unik dapat dikarakterisasi dengan strategi pencarian berbasis populasi dengan operator mutasi seleksi dan crossover. Untuk persoalan JSSP terdapat adanya presedence constraint yang membuat representasi kromosom pada GA memerlukan penggunaan operator crossover yang sesuai. Pada Tesis ini akan diimplementasikan empat algoritma dengan cara pendekatan yang berbeda untuk solusi persoalan JSSP yaitu algoritma eksak algoritma heuristik berdasarkan aturan prioritas dan dua pendekatan yang mengkombinasikan Metode Heuristik dan Algoritma Genetik yang disebut dengan Algoritma Hybrid. Algoritma Hybrid diajukan dengan harapan diperolehnya suatu cara penyelesaian JSSP yang lebih optimal daripada kedua algoritma heuristik dan genetik digunakan secara terpisah. Kedua cara pendekatan hybrid dirancang berdasarkan pemilihan susunan kromosom inisialisasi populasi awal dan operator genetik mutasi dan crossover yang digunakan. Kedua algoritma selanjutnya diberi nama Heuristic based GA dan Hybrid Genetic Algorithm.


ABSTRACT

Job-Shop Scheduling Problem JSSP is one of combinatorial optimization not only NP-Complete but it is one of the most difficult combinatorial optimization problems. With Heuristic Method it does not need to try all possibilities to get the real optimal solution as used by Exact Algorithm. Heuristic Method is able to find near-optimal solution. Besides that it is well known that Genetic Algorithm GA is also one of a good alternative to get the optimal solution. GA is uniquely can be characterized by searching strategy based on population with operator mutation selection and crossover. For the Job-Shop Scheduling Problem the existence of precedence constraint make the chromosome representation need using suitable crossover operator. This thesis will implement four algorithms with different approach method to solve the job-shop scheduling problem they are Exact Algorithm Heuristic based Priority Rule and combination of Heuristic Method and Genetic Algorithm and then called as Hybrid Algorithm. Hybrid Algorithm is proposed in order to get more optimal solution for Job-Shop Scheduling Problem instead of two algorithms heuristic and genetic using separately. Two different approaches of hybrid algorithm are designed based on choosing chromosome representation initial population and genetic operators mutation and crossover. And then two algorithms are namely Heuristic based GA and Hybrid Genetic Algorithm. Experimental result with Hybrid Genetic Algorithms showed that the proposed method had better solution instead of Heuristic Method. The performance of these algorithms has been measured on a set of Benchmark Problems formulated by Giffler and Thompson in such particular problems the hybrid algorithm can get the real optimal solution. So Hybrid Genetic Algorithm is one of the good methods to solve the Job Shop Scheduling Problem.



KeywordsPrecedence constraint ; Exact Algorithm ; Heuristic based priority rule ; Genetic algorithm ; Heuristic based GA ; Hybrid genetic
 
Subject:  Manajemen penjadwalan
Contributor
  1. Dr. Ir. Handayani Tjandrasa, MSc.
Date Create: 25/09/2001
Type: Text
Format: pdf ; 100 pages
Language: Indonesian
Identifier: ITS-Master-3100003018397
Collection ID: 3100002014859
Call Number: 005.1 Bad o


Source
Theses Information Engineering RT 005.1 Bad o, 2001

Coverage
ITS Community

Rights
Copyright @2001 by ITS Library. This publication is protected by copyright and permission should be obtained from the ITS Library prior to any prohibited reproduction, storage in a retrievel system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. For information regarding permission(s), write to ITS Library




[ Download - Summary ]

ITS-Master-3100002014859-165.pdf




 Similar Document...




! ATTENTION !

To facilitate the activation process, please fill out the member application form correctly and completely

Registration activation of our members will process up to max 24 hours (confirm by email). Please wait patiently

POLLING

Bagaimana pendapat Anda tentang layanan repository kami ?

Bagus Sekali
Baik
Biasa
Jelek
Mengecewakan





You are connected from 54.196.127.107
using CCBot/2.0 (http://commoncrawl.org/faq/)



Copyright © ITS Library 2006 - 2017 - All rights reserved.
Dublin Core Metadata Initiative and OpenArchives Compatible
Developed by Hassan