| Article ID: | iaor2009946 |
| Country: | Netherlands |
| Volume: | 159 |
| Issue: | 1 |
| Start Page Number: | 161 |
| End Page Number: | 181 |
| Publication Date: | Mar 2008 |
| Journal: | Annals of Operations Research |
| Authors: | Brucker Peter, Kampmeyer Thomas |
| Keywords: | heuristics: tabu search |
A tabu search algorithm for a cyclic job shop problem with blocking is presented. Operations are blocking if they must stay on a machine after finishing when the next machine is occupied by another job. During this stay the machine is blocked for other jobs. For this problem traditional tabu search moves often lead to infeasible solutions. Recovering procedures are developed which construct nearby feasible solutions. Computational results are presented for the approach.