|
|
|
|
A comparison of heuristics for scheduling problems in textile industry
|
|
|
|
|
|
|
|
نویسنده
|
nugraheni c.e. ,abednego l.
|
|
منبع
|
jurnal teknologi - 2016 - دوره : 78 - شماره : 6-6 - صفحه:99 -104
|
|
چکیده
|
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. © 2016 penerbit utm press. all rights reserved.
|
|
کلیدواژه
|
Flow shop scheduling problem; Heuristics; Scheduling; Textile industry
|
|
آدرس
|
dept. of informatics,parahyangan catholic university,bandung, Indonesia, dept. of informatics,parahyangan catholic university,bandung, Indonesia
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|