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 » Paper and Presentation » Manajemen Operasional (S2)
Posted by aprill@is.its.ac.id at 27/08/2015 21:12:05  •  1202 Views


PENYELESAIAN KASUS MIXED MODEL ASSEMBLY LINE UNTUK MINIMASI DELAYS DENGAN MENGGUNAKAN METODE METAHEURISTIK

MIXED MODEL ASSEMBLY LINE SEQUENCING TO MINIMIZE DELAYS USING META-HEURISTICS

Author :
ALBANA, ABDUH SAYID ( 2512 202 005 )




ABSTRAK

Saat ini permintaan pelanggan terus berubah. Hal ini membatasi manajer produksi untuk menangani kebutuhan yang berbeda dari pelanggan dan membuat berbagai produk yang berbeda yang memaksanya untuk menangani masalah dalam menyeimbangkan lini produksi Line Balancing dan membuat urutan yang dapat diterima Product Sequencing untuk meminimalkan biaya produksi. Pekerja dan mesin harus fleksibel untuk mengurangi waktu dan biaya setup sehingga berbagai jenis produk dapat diproduksi dalam urutan produksi campuran pada lini produksi yang sama. Jenis lini perakitan di mana pekerja bekerja pada model produk yang berbeda di lini perakitan yang sama harus digunakan. Lini produksi seperti ini disebut Mixed Model Assembly Line MMAL. Ada dua masalah utama dalam MMAL masalah line balancing dan masalah product sequencing. Kami lebih fokus bekerja pada masalah sequencing MMAL dengan tujuan untuk meminimalkan jumlah kelebihan beban kerja Work Overload. Metode mixed integer linear programming MILP sudah ada untuk masalah ini. Seperti banyak diketahui karakteristik dari MILP adalah membutuhkan waktu lama dalam perhitungan untuk kasus besar. Oleh karena itu metode lain yang disebut meta-heuristik diusulkan untuk menemukan solusi yang baik dalam waktu yang lebih singkat dengan kualitas solusi yang sama. Ada tiga jenis algoritma meta-heuristik yang digunakan dalam penelitian ini Algoritma Genetika GA Simulated Annealing SA dan Algoritma Genetika Simulated Annealing GASA. Tes numerik dilakukan untuk menguji dan membandingkan kinerja dari algoritma yang diusulkan contoh kecil data benchmark dan data dari studi kasus. Perbandingan dilakukan berdasarkan waktu komputasi dan kualitas solusi antara Mixed Integer Linear Programming dan metaheuristik juga di antara meta-heuristik itu sendiri.


ABSTRACT

Nowadays the demand of customers is continually changing. This constrains the production manager to deal with the different needs of the customers and making a different variety of product and forces him to deal with problems in balancing the line and making acceptable sequence to minimize the production costs. Workers and machinery have to be flexible to reduce the setup times and costs so that different kind of products can be manufactured in intermixed product sequences on the same line. A type of assembly line in which assemblers work on all different models of a product in the same assembly line have to be used. Such production lines are called the mixed-model assembly line MMAL. There are two main problems in MMAL assembly line balancing problem and product sequencing problem. We work on the MMAL sequencing problem with the objective to minimize total work overload. A mixed integer linear programming MILP already exists for this problem. As widely known the characteristic of the MILP is that its expensive in calculation time for big instances. Therefore another method called the meta-heuristic is proposed to find the best solution in a shorter time with the same solutions quality. Three types of meta-heuristic algorithm are used in this research Genetic Algorithm GA Simulated Annealing SA and Genetic Algorithm Simulated Annealing GASA. Numerical tests are carried out to test and compare the performance of the proposed algorithm small instances benchmark data and data from a case study. The comparisons are conducted based on the computational time and the quality of the solution between the Mixed Integer Linear Programming and meta-heuristic and among the meta-heuristic itself.



KeywordsMixed Model Assembly Line; Masalah Sequencing; Meta-heuristik
 
Subject:  Sistem pendukung keputusan; penjadwalan
Contributor
  1. Yannick Frein
  2. Gulgun Alpan-Gaujal
Date Create: 20/08/2015
Type: Text
Format: pdf
Language: Indonesian
Identifier: ITS-paper-25121150007822
Collection ID: 25121150007822
Call Number: RTI 658.53 Alb p


Source
Paper and Presentations, Industrial Engineering, RTI 658.53 Alb p, 2015

Coverage
ITS Community

Rights
Copyright @2015 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




[ Download - Summary ]

ITS-paper-25121150007822-38640.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.198.52.8
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