EEMCS EPrints Service
Hurink, J.L. and Knust, S. (2005) Tabu search algorithms for job-shop problems with a single transport robot. European journal of operational research, 162 (1). pp. 99-111. ISSN 0377-2217 *** ISI Impact 1,815 ***
This is the latest version of this eprint.
Full text available as:
Official URL: http://dx.doi.org/10.1016/j.ejor.2003.10.034
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.
Available Versions of this Item
Export this item as:
To request a copy of the PDF please email us request copy
To correct this item please ask your editor
Repository Staff Only: edit this item