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

Hurink, Johann and Knust, Sigrid (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

PDF
Restricted to UT campus only: Request a copy
363Kb

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. We present local search algorithms for this problem where appropriate neighborhood structures are defined using problem-specific properties. An one-stage procedure is compared with a two-stage approach and a combination of both. Computational results are presented for test data arising from job-shop benchmark instances enlarged by transportation and empty moving times.
Item Type:	Article
Copyright:	© 2005 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/63170
Official URL:	http://dx.doi.org/10.1016/j.ejor.2003.10.034
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 225729