A comparison of heuristics for scheduling problems in textile industry
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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Journal |
| Published: |
Jurnal Teknologi, Universiti Teknologi Malaysia
2016
|
| Subjects: | |
| Online Access: | http://www.myjurnal.my/public/article-view.php?id=98099 |