eprintid: 36226
rev_number: 8
eprint_status: archive
userid: 6
dir: disk0/00/03/62/26
datestamp: 2019-08-01 00:57:01
lastmod: 2019-08-01 00:57:01
status_changed: 2019-08-01 00:57:01
type: article
metadata_visibility: show
creators_name: Kurniawati, Dwi Agustina
creators_name: Nugroho, Yoga Isnaini
title: Computational Study of N-Job M-Machine Flow Shop Scheduling Problems: SPT, EDD, NEH, NEH-EDD, and Modified-NEH Algorithms
ispublished: pub
subjects: sains
divisions: artkl
full_text_status: restricted
keywords: Scheduling; flow shop; makespan; tardiness; NEH; EDD; SPT.
abstract: This paper discusses about the °ow shop scheduling problems using shortest processing time,
earliest due date (EDD), Nawaz, Enscore, and Ham (NEH), NEH-EDD, and modi¯ed-NEH
methods. The objective of this research is to determine the performance of these methods in
minimizing makespan and total tardiness. Processing times and due dates were randomly
generated, and computational studies were performed in Microsoft Visual Basic 6.0. The
experiments are performed for small and medium data sets. E±ciency index, relative error, and
run time measure the performance of each method. Experimental results showed that NEH has
the best performance in minimizing the makespan in both data sets; these are 53.35 time unit for
small data sets and 83.803 time unit for medium data sets. NEH-EDD has the best performance
in minimizing total tardiness with 9.37 time unit for small data sets and 231.02 time unit for
medium data sets. Modi¯ed-NEH, as the proposed method for minimizing makespan and total
tardiness at the same time, has good enough result. For minimizing the makespan, modi¯ed-
NEH results in 57.15 time unit for small data sets and 88.107 time unit for medium data sets.
For minimizing total tardiness, the modi¯ed-NEH results in 14.21 time unit for small data sets
and 246.57 time unit for medium sets.
Keywords: Scheduling; °ow shop; makespan; tardiness; NEH; EDD; SPT.
date: 2017-02-01
date_type: published
publication: Journal of Advanced Manufacturing Systems
volume: 16
number: 04
publisher: World Scientific Publishing Company
pagerange: 375-384
id_number: doi:10.1142/S0219686717500226
refereed: TRUE
issn: 0219-6867
official_url: http://doi.org/10.1142/S0219686717500226
citation:   Kurniawati, Dwi Agustina and Nugroho, Yoga Isnaini  (2017) Computational Study of N-Job M-Machine Flow Shop Scheduling Problems: SPT, EDD, NEH, NEH-EDD, and Modified-NEH Algorithms.  Journal of Advanced Manufacturing Systems, 16 (04).  pp. 375-384.  ISSN 0219-6867     
document_url: https://digilib.uin-suka.ac.id/id/eprint/36226/1/Dwi%20Agustina%20Kurniawati%20_%20COMPUTATIONAL%20STUDY%20OF%20N-JOB%20M-MACHINE%20FLOW%20SHOP%20SCHEDULING%20PROBLEMS.pdf