Heuristics for Scheduling in Flexible Flowshops Minimize the Makespan and Total Flowtime of Jobs

摘要：

This research attempts to solve a flexible flowshop bicriteria scheduling problem, in which the objective function is to minimize a weighted sum of total flowtime and makespan. Because of the NP-hardness of the integer linear programming model of the considered problem, heuristics within two major groups based on modifying two better performing flowshop heuristics for their performances of makespan namely NEH and CDS are proposed. Computational experiments show that the best NEH based heuristics perform better than the best CDS based heuristics. The experiments also show that the best NEH based heuristics are relatively efficient when their results are compared with the lower bounds proposed in this study.

关键词： Scheduling Flexible Flowshop Makespan Total Flowtime Heuristics

作者: Iraj MAHDAVI Vahid ZAREZADEH

作者单位: Mazandaran University of Science & Technology,Babol,Iran

会议类型: 国际会议

会议名称: 工业工程与系统管理2007年国际会议(International Conference on Industrial Engineering and Systems Management)(IESM 2007)

会议地点: 北京

会议语种:英文

在线出版日期: 2007-05-30（万方平台首次上网日期，不代表论文的发表时间）