Hurink, J.L. and Knust, S.
Tabu search algorithms for job-shop problems with a single transport robot.
Department of Applied Mathematics, University of Twente, Enschede.
There is a more recent version of this eprint available. Click here to view it.
Full text available as:
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:||Internal Report (Memorandum)|
|Research Group:||EWI-DMMP: Discrete Mathematics and Mathematical Programming|
|Additional Information:||Imported from MEMORANDA|
|Deposited On:||16 July 2006|
Available Versions of this Item
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item