EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

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

Home Policy Brochure Browse Search User Area Contact Help

Hurink, J.L. and Knust, S. (2001)
Tabu search algorithms for job-shop problems with a single transport robot. Memorandum 1579, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF

199 Kb

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:	Internal Report (Memorandum)
Research Group:	EWI-DMMP: Discrete Mathematics and Mathematical Programming
Additional Information:	Imported from MEMORANDA
ID Code:	3399
Deposited On:	16 July 2006
Refereed:	No
More Information:	statistics

Available Versions of this Item

Tabu search algorithms for job-shop problems with a single transport robot
(deposited 16 July 2006)
[Currently Displayed]
- Tabu search algorithms for job-shop problems with a single transport robot (deposited 30 August 2006)

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item