A COMPARISON OF HEURISTICS FOR SCHEDULING PROBLEMS IN TEXTILE INDUSTRY

Authors

  • Cecilia E. Nugraheni Dept. of Informatics, Parahyangan Catholic University, Bandung, Indonesia
  • Luciana Abednego Dept. of Informatics, Parahyangan Catholic University, Bandung, Indonesia

DOI:

https://doi.org/10.11113/jt.v78.9034

Keywords:

Textile industry, scheduling, flow shop scheduling problem, heuristics

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.

References

Scholz-Retter Bernd et al. 2015. Applying Autonomous Control in Apparel Manufacturing. Proc. Of 9th WSEAS Int. Conference on Robotics, Control and Manufacturing Technology. 73-78.

Vladimir Modrák and R. Sudhakara Pandian. 2010. Flow Shop Scheduling Algorithm to Minimize Completion Time for n-Jobs m-Machines Problem. Technical Gazette. 17(3): 273-278.

Rubén Ruiz and Concepción Maroto. 2005. A Comprehensive Review and Evalution of Permutation Flowshops Heuristics. European Journal of Operational Research. 165: 479-494.

PavolSemanco and Vladimir Modrak. 2012. A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem. Acta Polytechnica Hungarica. 9(5).

Cecilia, E. Nugraheni and Luciana Abednego. 2015. A Survey on Heuristics for Scheduling Problem in Textile Industry. Proc. of ICEAI 2015. May. Kyoto, Japan.

E. Taillard. 1990. Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem. European Journal of Operational Research. 47: 65-74.

Thomas Morton. 1993. Heuristic Scheduling Systems: With Application to Production Systems and Project Management. John Wiley & Sons.

F. Wang, Y. Rao, and Y. Hou. 2011. Design and Application of A New Hybrid Heuristic Algorithm for Flow Shop Scheduling. I.J. Computer Network and Information Security. 2: 41-49.

Sulaksmi, A., Annisa Kesy Garside, dan Fithriany Hadziqah. Penjadwalan Produksi dengan Algoritma Heuristik Pour (StudiKasus: Konveksi One Way Malang). Jurnal Teknik Industri. 15(1): 35-44.

Robert, N. Tomastik, Peter, B. Luh, and Guandong, Liu. Scheduling Flexible Manufacturing System for Apparel Production. IEEE Transaction on Robotics and Automation. 12(5): 789-799.

Cecilia, E. Nugraheni. Universal Properties Verification of Parameterized Parallel Systems Lecture Notes in Computer Science. 3482: 453-462.

Cecilia E. Nugraheni and Luciana Abednego. A Study On Agent Scheduling Scenarios In Multi-Agent Systems. Journal of Theoretical and Applied Information Technology. 76(2): 238-245.

Downloads

Published

2016-06-13

How to Cite

A COMPARISON OF HEURISTICS FOR SCHEDULING PROBLEMS IN TEXTILE INDUSTRY. (2016). Jurnal Teknologi, 78(6-6). https://doi.org/10.11113/jt.v78.9034