A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts
✍ Scribed by Atabak Elmi; Maghsud Solimanpur; Seyda Topaloglu; Afshin Elmi
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 444 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0360-8352
No coin nor oath required. For personal study only.
✦ Synopsis
This paper addresses the problem of scheduling parts in job shop cellular manufacturing systems by considering exceptional parts that need to visit machines in different cells and reentrant parts which need to visit some machines more than once in non-consecutive manner. Initially, an integer linear programming (ILP) model is presented for the problem to minimize the makespan, which considers intercellular moves and non-consecutive multiple processing of parts on a machine. Due to the complexity of the model, a simulated annealing (SA) based solution approach is developed to solve the problem. To increase the efficiency of the search algorithm, a neighborhood structure based on the concept of blocks is applied. Subsequently, the efficiency of the ILP model and the performance of the proposed SA are assessed over a set of problem instances taken from the literature. The proposed ILP model was coded in Lingo 8.0 and the solution obtained by the proposed SA was compared to the optimal values. The computational results demonstrate that the proposed ILP model and SA algorithm are effective and efficient for this problem.