Tabu search algorithms for job-shop problems with a single transport robot

Share/Save/Bookmark

Hurink, J.L. and Knust, S. (2001) Tabu search algorithms for job-shop problems with a single transport robot. [Report]

[img]
Preview
PDF
198Kb
Abstract: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.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65766
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page