A Comparison of Heuristics for Scheduling Problems in Textile Industry

Nugraheni, Cecilia Esti; Abednego, Luciana

dc.contributor.author	Nugraheni, Cecilia Esti
dc.contributor.author	Abednego, Luciana
dc.date.accessioned	2017-03-20T07:44:45Z
dc.date.available	2017-03-20T07:44:45Z
dc.date.issued	2016
dc.identifier.uri	http://hdl.handle.net/123456789/1041
dc.description	JURNAL TEKNOLOGI (SCIENCE & ENGINEERING); Vol.78 : 6-6, 2016
dc.description.abstract	Scheduling is an important problem in textile industry. The scheduling problem in textile industry generally belongs to the flow shop scheduling problem (FSSP). There are many heuristics for solving this problem. Eight heuristics, namely FCFS, Gupta, Palmer, NEH, CDS, Dannenbring, Pour, and MOD are considered and compared. Experimental results show the best heuristic is NEH and the worst heuristic is FCFS.	en_US
dc.description.uri	www.jurnalteknologi.utm.my
dc.language.iso	en	en_US
dc.publisher	University Teknologi Malaysia	en_US
dc.relation.ispartofseries	JURNAL TEKNOLOGI (SCIENCE & ENGINEERING); Vol.78 : 6-6, 2016
dc.subject	Textile industry	en_US
dc.subject	scheduling
dc.subject	flow shop scheduling problem
dc.subject	heuristics
dc.title	A Comparison of Heuristics for Scheduling Problems in Textile Industry	en_US
dc.type	Journal Articles	en_US