4.0 Article

AN MCDM-BASED APPROACH TO COMPARE THE PERFORMANCE OF HEURISTIC TECHNIQUES FOR PERMUTATION FLOW-SHOP SCHEDULING PROBLEMS

出版社

UNIV CINCINNATI INDUSTRIAL ENGINEERING
DOI: 10.23055/ijietap.2023.30.3.8699

关键词

Comparative; Computational; Heuristic; Multi-Criteria Decision-Making; Performance Evaluation; Permutation Flow-Shop Sequencing Problems

向作者/读者索取更多资源

Scheduling is crucial in determining production cost aspects for industrial and manufacturing sectors. Solving flow-shop problems reduces production costs and improves output. This paper compares heuristic techniques for solving Permutation Flow-Shop Sequencing Problems and evaluates their performance. Eight techniques were compared using a computer simulation program, and a multi-criteria decision-making approach was followed for performance evaluation. The study reveals the ranking of the techniques and provides a framework for the evaluation of new scheduling methods.
In the industrial and manufacturing sectors, scheduling is an essential component in the process of determining crucial production cost aspects of corporate strategy. Solving flow-shop problems minimizes the makespan it takes for all jobs to be completed, reducing production costs and boosting output. Therefore, many heuristics techniques have been developed to assist in reaching a good and quick solution. However, newly developed techniques necessitate testing their performance against the classical ones. Therefore, this paper aims to conduct a comparative analytical, computational study of heuristic techniques for solving Permutation Flow-Shop Sequencing Problems and evaluating their performance. Eight techniques were compared by generating a set of problems of varying sizes and then solving them via a developed computer simulation program. Furthermore, a multi-criteria decision-making approach is followed for their performance evaluation. Results of the study revealed that based on six performance evaluation criteria, Dannenbring's technique is the first best, followed by the Slope Index technique as the second best, then the technique by Campbell, Dudek, and Smith, Hundal, the Time Deviation technique, Palmer, Gupta, and the technique by Jayasankari, Jayakumar, and Vijayaragavan, respectively. This paper puts forward a ranking of the developed techniques for flow-shop problems and a framework for the performance evaluation of new permutation flow-shop scheduling problem methods.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.0
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据