Articles uploaded in MyJurnal |
|
|
View Article |
A comparison of heuristics for scheduling problems in textile industry
Nugraheni, Cecilia E1, Abednego, Luciana2.
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.
Affiliation:
- Universitas Katolik Parahyangan, Indonesia
- Universitas Katolik Parahyangan, Indonesia
Download this article (This article has been downloaded 120 time(s))
|
|
Indexation |
Indexed by |
MyJurnal (2021) |
H-Index
|
6 |
Immediacy Index
|
0.000 |
Rank |
0 |
Indexed by |
Scopus 2020 |
Impact Factor
|
CiteScore (1.4) |
Rank |
Q3 (Engineering (all)) |
Additional Information |
SJR (0.191) |
|
|
|
|
|