A Hybrid Metaheuristic for the Lot Streaming Problem in Job Shops
This paper presents a hybrid metaheuristic for solving the lot streaming problem in job shop production systems. In contrast with conventional tabu search implementations, where the disjunctive graph is adopted to represent the scheduling problem, our tabu search approach is based on permutation with repetition. Moreover, a specific procedure inspired by genetic algorithms is incorporated to seek better subiot sizes for a given schedule. By combining two metaheuristics,good solutions can be found in reasonable computing times and experimental results confirm the remarkable advantage of lot streaming.
Udo Buscher Liji Shen
Chair of Industrial Management, Department of Business Administration and Economics Dresden University of Technology, Germany
国际会议
The Seventh International Symposium(ISORA08)(第七届国际效力研究及其应用学术会议)
云南丽江
英文
425-431
2008-10-31(万方平台首次上网日期,不代表论文的发表时间)