Journal of Shanghai Jiaotong University ›› 2012, Vol. 46 ›› Issue (12): 2003-2008.

• Others • Previous Articles     Next Articles

An Integrated Tabu Search Algorithm for the Lot Streaming Problem in Flexible Job Shops

 LU  Han-Dong, HE  Wei-Ping, ZHOU  Xu, LI  Ya-Jie   

  1. (The Key Laboratory of Contemporary Design and Integrated Manufacturing Technology of Ministry of Education, Northwestern Polytechnical University, Xi’an 710072, China)  
  • Received:2011-12-26 Online:2012-12-29 Published:2012-12-29

Abstract: To solve the problem of flexible job shop scheduling with lot-splitting, a flexible size lot-splitting scheduling algorithm based on tabu search was presented, which incorporates the predetermination of sublot sizes, the determination of schedules based on tabu search and the variation of sublot sizes, to minimize the makespan and machine workload. Performance of the algorithm was evaluated through simulations, and the results demonstrate the feasibility , efficiency and utility of the algorithm.

Key words: scheduling, lot-splitting, flexible job-shop, tabu search

CLC Number: