Simulated annealing approach for the single-machine total late work scheduling problem with a position-based learning

摘要：

This paper considers a single-machine scheduling problem with a position-based learning effect where the aim is to find an optimal sequence to minimize the total late work. The late work for a job means the amount of processing of this job that is performed after its due date. Because the problem under consideration is NP-hard, this paper then proposes several simulated annealing algorithms for the near-optimal solution. Finally, the computational results of proposed algorithms are also reported.

作者: Chin-Chia Wu Hung-Ming Chen Shuenn-Ren Cheng Chou-Jung Hsu Wen-Hung Wu

作者单位: Department of Statistics,Feng Chia University,Taichung, Taiwan Graduate Institute of Business Administration,Cheng Shiu University,Kaohsiung,County, Taiwan Department of Industrial Engineering and Management ,Nan Kai College, Nantou,Taiwan Department of Business Administration, Kang-Ning Junior College, Taipei, Taiwan

会议类型: 国际会议

会议名称: 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management(2011 IEEE 第十八届工业工程与工程管理国际会议 IEEM2011)

会议地点: 长春

会议语种:英文

页码: 839-843

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