Ilyas Masudin, Dana Marsetya Utama, Febrianto Susastro



This article attempts to schedule flow shop production using Nawaz Enscore Ham (NEH) to schedule jobs machining. The objective of this paper is to minimize total makespan which could reduce total production costs. This paper is based on the case study where NEH is applied in scheduling jobs in machines and then compared with the existing machine’s scheduling. The algorithm of NEH is also used to reduce idle time of machines so that the utility or performances of the machine are maintained.  The results of NEH simulation indicate that by applying NEH algorithm to scheduling machines for 10 jobs and 5 machines can reduce 2.5 per cent or 118 minutes of completing time of jobs. It also decreases total idle time of machines about 582 minutes compared with the existing scheduling.


scheduling; Nawaz Enscore Ham; flow shop; completing time


Ginting, Rosnani. 2009. Penjadwalan Mesin. Yogyakarta: PT. Graha ilmu.

Baker, K.R. 1974. Introduction to Sequencing and Scheduling. Canada: John Wiley & Sons, Inc.

Conway, R. W.; Maxel, W.L.; and Miller, L.W. 2001. Theory of Scheduling. New York, USA: Andison Wesley Publishing Company Inc.

Taillard, E, 1989. Benchmarks Basic Scheduling Problems. OWRP/21 Dec 1989.

Satriawan, Nedi. 2010. Penjadwalan Produksi Flow Shop Menggunakan Algoritma Genetika dan NEH. Skripsi S1. Bandung: Program Studi Ilmu Komputer, Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam, Universitas Pendidikan Indonesia.

Supriyanto. 2008. Penjadwalan Pekerjaan Pada Fleksible Flowshop Dengan Kriteria Minimasi Mean Tardiness Di CV. Dimas Rotan Sukoharjo. Skripsi S1. Surakarta: Universitas Negeri Sebelas Maret.

Nawaz, Muhammad; Enscore, E. Emory Jr.; dan Ham, Inyong. 1983. A Heuristic Algorithm for m-Machine, n-Job Flow-shop Sequencing Problem. Journal Omega. Vol. 11, No. 1, pp. 91-95.

Article Metrics

Abstract view(s): 838 time(s)
PDF (Bahasa Indonesia): 1565 time(s)


  • There are currently no refbacks.