 |
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 08.30 s/d 15.30 WIB
 Taufik
Dewi
Ansi
Tondo
|
! 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 3 x 24 hours (confirm by email). Please wait patiently
Still Confuse?
Please read our User Guide
|
POLLINGBagaimana pendapat Anda tentang layanan repository kami ?
     
 Pengunjung hari ini : 456
 Total pengunjung : 6590
Hits hari ini : 25363
Total Hits : 91256
 Pengunjung Online: 44
• You are connected from 38.107.179.211 |
Detail Collection
ITS » Undergraduate Theses » Teknik Industri
Posted by dee@its.ac.id at 16/01/2012 14:37:08 • 59 Views
PENDEKATAN CROSS ENTROPY-GENETIC ALGORITHM PADA PERMASALAHAN MULTI OBJECTIVE JOB SHOP SCHEDULING
A CROSS ENTROPY-GENETIC ALGORITHM FOR MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEM
Created by :
NURKHALIDA, LILIEK ( 2507100703 )
| Subject: | Algoritma | | Alt. Subject : | Genetic algoritms | | Keyword: | Multi objective
Job shop scheduling
Cross entropy
Genetic algorithm |
[ Description ]
Multi Objective Job Shop Scheduling Problem (MOJSP) merupakan permasalahan penentuan urutan operasi dari beberapa job dengan mempertimbangkan lebih dari satu tujuan yang ingin dicapai. Hal ini menjadikan penyelesaiannya tidak mudah karena kompleksitas masalah yang tinggi. Perkembangan metoda optimasi untuk mencapai solusi permasalahan ini mendorong munculnya banyak metode penyelesaian baru. Penelitian ini menawarkan pendekatan alternatif Cross Entropy-Genetic Algorithm untuk menyelesaikan kasus job shop dengan multi objektif. Metoda ini merupakan sintesa dari algoritma Cross Entropy dan Genetic Algorithm. Algoritma hibrid ini telah berhasil diterapkan pada kasus job shop scheduling dengan objektif tunggal. Untuk mengakomodasi perhitungan multi objektif, digunakan pendekatan fungsi utilitas (pembobotan). Dari hasil eksperimen yang dilakukan, tampak Cross Entropy-Genetic Algorithm dapat menghasilkan solusi yang kompetitif dibanding metoda Simulated Annealing.
Alt. Description
Multi Objective Job Shop Scheduling Problem (MOJSP) is a problem in defining optimal operation sequences of some jobs according to more than one goal to achieve. The problems get harder to solve because of its complexity. The development on optimization method has led many new methods to solve this problem. This research offers an approach of Cross Entropy-Genetic Algorithm method to solve job shop scheduling problem with multi objectives. The method was born from recombination of Cross Entropy method with Genetic Algorithm. This algorithm has been successfully applied on single objective job shop scheduling. The weighted objective approach was proposed to accommodate multi objective calculation. From the experiment result shows that generally, Cross Entropy-Genetic Algorithm has competitive solution to Simulated Annealing.
| Contributor | : |
- Ir. Budi Santosa, M.S., Ph.D
| | Date Create | : | 21/07/2011 | | Type | : | Text | | Format | : | pdf | | Language | : | Indonesian | | Identifier | : | ITS-Undergraduate-3100011045155 | | Collection ID | : | 3100011045155 | | Call Number | : | RSI 511.8 Nur p |
Source :
Undergraduate Thesis of Industrial Engineering, RSI 511.8 Nur p, 2011
Coverage :
ITS Community
Rights :
Copyright @2011 by ITS Library. This publication is protected by copyright and per obtained from the ITS Library prior to any prohibited reproduction, storage in a re transmission in any form or by any means, electronic, mechanical, photocopying, reco For information regarding permission(s), write to ITS Library
Share this information to :
Google Bookmarks | Technorati | Del.icio.us | Digg
[ Free Download - Free for All ]
- ITS-Undergraduate-17273-2507100703-Cover_id.pdf - 124 KB
 - ITS-Undergraduate-17273-2507100703-Cover_en.pdf - 54 KB
- ITS-Undergraduate-17273-2507100703-Approval_Sheet.pdf - 800 KB
- ITS-Undergraduate-17273-2507100703-Abstract_id.pdf - 146 KB
- ITS-Undergraduate-17273-2507100703-Abstract_en.pdf - 238 KB
- ITS-Undergraduate-17273-2507100703-Preface.pdf - 208 KB
- ITS-Undergraduate-17273-2507100703-Table_of_Content.pdf - 206 KB
- ITS-Undergraduate-17273-2507100703-Chapter1.pdf - 241 KB
- ITS-Undergraduate-17273-2507100703-Conclusion.pdf - 217 KB
- ITS-Undergraduate-17273-2507100703-Bibliography.pdf - 287 KB
- ITS-Undergraduate-17273-2507100703-Biography.pdf - 262 KB
- ITS-Undergraduate-17273-2507100703-Paper.pdf - 820 KB
- ITS-Undergraduate-17273-2507100703-Presentation-1.pdf - 1788 KB
- ITS-Undergraduate-17273-2507100703-Presentation-2.pdf - 1420 KB
[ FullText Content - Please, register first ]
1. ITS-Undergraduate-17273-2507100703-Chapter2-1.pdf - 425 KB
2. ITS-Undergraduate-17273-2507100703-Chapter2-2.pdf - 1897 KB
3. ITS-Undergraduate-17273-2507100703-Chapter3.pdf - 707 KB
4. ITS-Undergraduate-17273-2507100703-Chapter4.pdf - 420 KB
5. ITS-Undergraduate-17273-2507100703-Chapter5.pdf - 348 KB
6. ITS-Undergraduate-17273-2507100703-Enclosure.pdf - 449 KB
[ Link of Contents]
 10 Similar Document...
10 Related Document...
|
