Exploring a two-criterion order scheduling problem by using five heuristics

摘要：

　　Recently the order scheduling(OS)problem is concerned by the research community.However,the OS study with more than one criterion is only few.In view of this limitation,we address an OS problem in which the objective is to find a schedule to minimize the sum of total flowtime and the maximum tardiness.The complexity of this problem is very difficult.Thus,we use five heuristics including three modified heuristics,an iterated greedy(IG)method,and a particle swarm colony(PSO)algorithm for finding approximately solutions.Finally,the statistical results and comparison performances of all five heuristics are reported.

关键词： order scheduling particle swarm optimization iterated greedy total flowtime maximum tardiness

作者: Win-Chin Lin Carol Yu Shuenn-Ren Cheng Tzu-Yun Lin Yuan-Po Chao Shang-Chia Liu Chin-Chia Wu

作者单位: Department of Statistics,Feng Chia University,Taichung,40724,Taiwan Fundraising office,Fu Jen Catholic University Hospital,New Taipei City,24205,Taiwan Graduate Institute of Business Administration,Cheng Shiu University,Kaohsiung,Taiwan Department of Business Administration,Cheng Shiu University,Kaohsiung,Taiwan Department of Business Administration,Fu Jen Catholic University,New Taipei City,Taiwan

会议类型: 国际会议

会议名称: 2017年经济与企业管理国际学术会议(FEBM2017)

会议地点: 上海

会议语种:英文

页码: 232-239

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