A New Neighborhood for the Job Shop Scheduling Problem

摘要：

The effectiveness of the local search aigorithms for shop scheduling problems is proved frequently． Local search algorithms like tabu search use neighborhood structures in order to obtain new solutions．This paper presents a new neighborhood for the job shop scheduling problem．In this neighborhood， few enhanced conditions are proposed t0 prevent cycle generation．These conditions allow that the neighborhood encompasses larger number of solutions without increasing the order of computational efforts．

关键词： scheduling mixedshop general shop stage shop

作者: Mohammad Mahdi Nasiri Farhad Kianfar

作者单位: Department of Industrial Engineering Sharif University of Technology Tehran,Iran

会议类型: 国际会议

会议名称: 2011 International Conference on Manufacturing and Industrial Engineering(ICMIE 2011)(2011年制造及工业工程国际会议)

会议地点: 海口

会议语种:英文

页码: 346-348

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