STUDI PERBANDINGAN PERFORMANCE ALGORITMA HEURISTIK POUR TERHADAP MIXED INTEGER PROGRAMMING DALAM MENYELESAIKAN PENJADWALAN FLOWSHOP

Authors

  • Tessa Vanina Soetanto Faculty of Industrial Technology, Petra Christian University
  • Herry Christian Palit Faculty of Industrial Tecnology, Petra Christian University
  • Ika Munika Alumnus, Faculty of Industrial Technology, Petra Christian University

:

https://doi.org/10.9744/jti.6.1.79-85

Keywords:

flowshop, makespan, Pour heuristic algorithm, Mixed Integer Programming.

Abstract

This paper presents a study about new heuristic algorithm performance compared to Mixed Integer Programming (MIP) method in solving flowshop scheduling problem to reach minimum makespan. Performance appraisal is based on Efficiency Index (EI), Relative Error (RE) and Elapsed Runtime. Abstract in Bahasa Indonesia : Makalah ini menyajikan penelitian tentang performance algoritma heuristik Pour terhadap metode Mixed Integer Programming (MIP) dalam menyelesaikan masalah penjadwalan flowshop dengan tujuan meminimalkan makespan. Penilaian performance dilakukan berdasarkan nilai Efficiency Index (EI), Relative Error (RE) dan Elapsed Runtime. Kata kunci: flowshop, makespan, algoritma heuristik Pour, Mixed Integer Programming.

Downloads

Published

2005-04-28

How to Cite

[1]
T. V. Soetanto, H. C. Palit, and I. Munika, “STUDI PERBANDINGAN PERFORMANCE ALGORITMA HEURISTIK POUR TERHADAP MIXED INTEGER PROGRAMMING DALAM MENYELESAIKAN PENJADWALAN FLOWSHOP”, Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri, vol. 6, no. 1, pp. 79-85, Apr. 2005.

Issue

Vol. 6 No. 1 (2004): JUNE 2004

Section

Articles

License

Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).


This work is licensed under a  Creative Commons Attribution License (CC BY).

Most read articles by the same author(s)