Dian Setiya Widodo, Purnomo Budi Santoso, Eko Siswanto


 In the flow shop scheduling each job will go through every machine in the same order. The goal of this research is to complete a series of jobs in order to obtain the optimal makespan  for stick skewers rounding machine. It is become necessities because the company has no planning and scheduling, while the demand exceeds the capacity Thus, optimize the scheduling is needed to be done. One way to optimize the scheduling is to minimize makespan. Based on the results of the research Cross Entropy Algorithm-Genetic Algorithm (CEGA) can provide the optimal solution. This is evident by a comparison technique that enumeration techniques obtained similar results with makespan 1982 seconds, but when compared to the company, CEGA method is better with makespan efficiency of 12.18%. The use of CEGA with the MATLAB has more advantages that simplify and speed in performing the calculations to can optimal solution. 


Cross Entropy Algorithm-Genetic Algorithm; Flow Shop Scheduling; Makespan

Full Text:



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.

Etiler, O., Toklu, B., Atak, M., dan Wilson, J., 2004, “A Genetic Algorithm For Flow Shop Scheduling Problems”, Journal of the Operational Research Society.

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.

Purnama, I. L. I., 2000, “Implementasi Integer Linear Programming Pada Perhitungan Makespan Dalam Penjadwalan Produksi”, Jurnal Teknologi Industri, Vol. IV.

Sahputra, I. H., Octavia, T., dan Chandra, A. S., 2009, “Tabu Search Sebagai Local Search Pada Algoritma Ant Colony Untuk Penjadwalan Flow Shop”, Jurnal Teknologi Industri, Vol. IV.

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

Soetanto, T. V., Palit, H. C., dan Munika, I., 2004, “Studi Perbandingan Performance Algoritma Heuristik Pour Terhadap Mixed Integer Programming Dalam Menyelesaikan Penjadwalan Flow Shop”, Jurnal Teknik Industri Vol. 6.



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.