A hybrid approach for minimizing makespan in permutation flowshop scheduling

详细信息    查看全文

• 作者：Kannan Govindan ; R. Balasundaram ; N. Baskar…
• 关键词：Flowshop scheduling ; makespan ; decision tree algorithm ; scatter search algorithm ; hybrid algorithm
• 刊名：Journal of Systems Science and Systems Engineering
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：26
• 期：1
• 页码：50-76
• 全文大小：
• 刊物类别：Engineering
• 刊物主题：Complexity; Economic Theory/Quantitative Economics/Mathematical Methods; Operation Research/Decision Theory;
• 出版者：Springer Berlin Heidelberg
• ISSN：1861-9576
• 卷排序：26

文摘

This work proposes a hybrid approach for solving traditional flowshop scheduling problems to reduce the makespan (total completion time). To solve scheduling problems, a combination of Decision Tree (DT) and Scatter Search (SS) algorithms are used. Initially, the DT is used to generate a seed solution which is then given input to the SS to obtain optimal / near optimal solutions of makespan. The DT used the entropy function to convert the given problem into a tree structured format / set of rules. The SS provides an extensive investigation of the search space through diversification. The advantages of both DT and SS are used to form a hybrid approach. The proposed algorithm is tested with various benchmark datasets available for flowshop scheduling. The statistical results prove that the proposed method is competent and efficient for solving flowshop problems.