PENJADWALAN FLOW SHOP DENGAN PENDEKATAN CROSS ENTROPY-GENETIC ALGORITHM UNTUK MENURUNKAN MAKESPAN PADA PEMBUATAN RODA GIGI

  • Dian Setiya Widodo Politeknik 17 Agustus 1945 Surabaya
  • Mario Sarisky Dwi Ellianto Politeknik 17 Agustus 1945 Surabaya
DOI: https://doi.org/10.30996/he.v12i02.629

Abstract

Flow shop is the process of determining the sequence of jobs that have the same product path. While the flow-shop scheduling takes assumption that a number of jobs that each has the same machine work sequence. The problems faced by com-panies, namely the high demand and yet the existence of a good scheduling planning resulted in the company should be able to optimize sche-duling job. One of the ways to solve these problems is by minimizing the Makespan. This research will solve the problem regarding to the flow shop scheduling by using cross entropy-genetic algorithm (CEGA) method to minimize Makespan. The technique that is used to solve the problem is by comparing the result of the application of existing methods in the company with the proposed method (CEGA). To support the application of CEGA used MATLAB software. Finally known that the results CEGA can give optimal solution, Makespan values obtained for 10829 seconds. So far, it was more effective than the method that used at the firm with Makespan efficiency by 10.06%.
Keywords: Flow Shop, Scheduling, Cross Entropy-Genetic Algorithm, Makespan.

Downloads

Download data is not yet available.

References

Baker, K., 1974, Introduction to Sequencing and Scheduling, John Wiley and Sons Inc., Singapore.

Berlianti, I., dan Arifin, M., 2010, Teknik-teknik Optimasi Heuristik, Graha Ilmu. Yogyakarta.

Budiman M.A., 2010, Pendekatan Cross Entropy-Genetic Algorithm Untuk Permasalahan Penjadwalan Job Shop Tanpa Waktu Tunggu Pada Banyak Mesin, Surabaya: Institut Teknologi Sepuluh Nopember.

Hanka, M. K. R., dan Santosa, B., 2013. Pengembangan Algoritma Hybrid Cross Entropy-Genetic Algorithm Pada Permasalahan Multiobjective Job Shop Scheduling Untuk Minimasi Makespan Dan Mean Flow Time, Tugas Akhir : Institut Teknologi Sepuluh Nopember.

Nurkhalida, L., dan Santosa, B., 2012, Pendekatan Cross Entropy-Genetic Algorithm Pada Permasalahan Multi Objective Job Shop Scheduling,UPT. Perpustakaan Institut Teknologi Sepuluh Nopember Surabaya.

Santosa B., dan Willy, P., 2011, Metoda Metaheuristik Konsep dan Implementasi, Guna Widya, Surabaya.

Widodo, D.S., Santoso, P. B., dan Siswanto, E., 2014, Pendekatan Algoritma Cross Entropy-Genetic Algorithm Untuk Menurunkan Makespan Pada Penjadwalan Flow Shop, Journal of Engineering and Management in Industrial System Vol. 2.

Published
2016-03-24
How to Cite
Widodo, D., & Ellianto, M. (2016). PENJADWALAN FLOW SHOP DENGAN PENDEKATAN CROSS ENTROPY-GENETIC ALGORITHM UNTUK MENURUNKAN MAKESPAN PADA PEMBUATAN RODA GIGI. Heuristic, 12(02). https://doi.org/10.30996/he.v12i02.629
Issue
Vol 12 No 02 (2015)
Section
Articles

Authors who publish with Heuristic agree to the following terms:

    1. Authors transfer the copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.. that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access)