EEMCS
Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


6072 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. (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:

PDF
 - Univ. of Twente only
364 Kb

Official URL: http://dx.doi.org/10.1016/j.ejor.2003.10.034

Exported to Metis

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
Research Group:EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:CTIT-eProductivity
Research Project:BRICKS/IS3: Decision Support Systems for Logistic Networks and Supply Chain Optimization
ID Code:6072
Status:Published
Deposited On:30 August 2006
Refereed:Yes
International:Yes
ISI Impact Factor:1,815
More Information:statisticsmetis

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