A Tabu Search Algorithm for the Stage Shop Problem
This paper presents stage shop problem which is a special ease of the general shop．The stage shop is a more realistic generalization of the mixed shop problem．In the stage shop problem．each job has several stages of operations．In order to solve the stage shop problem with makespan objective function．a tabu search algorithm is developed．in addition．an existing Lower bound of the job shop is adapted to the new problem and the computational results have been compared to it．The proposed TS algorithm has reached the optimal solutions for about half of the problem instances．
scheduling mixed shop general shop stage shop
Mohammad Mahdi Nasiri Farhad Kianfar
Department of Industrial Engineering Sharif University of Technology Tehran,Iran
国际会议
海口
英文
289-293
2011-02-22（万方平台首次上网日期，不代表论文的发表时间）