We consider a generalized job-shop problem where the jobs additionally have to be transported between the machines by a single transport robot. Besides transportation times for the jobs, empty moving times for the robot are taken into account. The objective is to determine a schedule with minimal makespan.
['Johann L. Hurink', 'Sigrid Knust']
Tabu search algorithms for job-shop problems with a single transport robot