A COMPARISON OF HEURISTICS FOR SCHEDULING PROBLEMS IN TEXTILE INDUSTRY

被引：0
作者：
Nugraheni, Cecilia E. [1 ]
Abednego, Luciana [1 ]
机构：
[1] Parahyangan Catholic Univ, Dept Informat, Bandung, Indonesia
来源：
JURNAL TEKNOLOGI | 2016年 / 78卷 / 6-6期
关键词：
Textile industry; scheduling; flow shop scheduling problem; heuristics;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
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.
引用
收藏
页码：99 / 104
页数：6
相关论文
共 12 条
  • [1] Bernd Scholz-Retter, 2015, P 9 WSEAS INT C ROB, P73
  • [2] Cecilia E. Nugraheni, LECT NOTES COMPUTER, V3482, P453
  • [3] Modrak V, 2010, TEH VJESN, V17, P273
  • [4] Morton T, 1993, HEURISTIC SCHEDULING
  • [5] Nugraheni Cecilia E., 2015, P ICEAI 2015 MAY KYO
  • [6] Nugraheni Cecilia E., J THEORETICAL APPL I, V76, P238
  • [7] Robert N. Tomastik, IEEE T ROBOTICS AUTO, V12, P789
  • [8] A comprehensive review and evaluation of permutation flowshop heuristics
    Ruiz, R
    Maroto, C
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (02) : 479 - 494
  • [9] Semanco P, 2012, ACTA POLYTECH HUNG, V9, P177
  • [10] Sulaksmi A., JURNAL TEKNIK INDUST, V15, P35
12