A tabu search algorithm for scheduling a single robot in a job-shop environment

Authors: Hurink J.; Knust1 S.

Source: Discrete Applied Mathematics, Volume 119, Number 1, 15 June 2002 , pp. 181-203(23)

Publisher: Elsevier

Buy & download fulltext article:

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Keywords: Scheduling; Traveling salesman problem with time windows; Time-lags; Tabu search

Language: English

Document Type: Research article

DOI: http://dx.doi.org/10.1016/S0166-218X(01)00273-6

Affiliations: 1: Faculty of Mathematical Sciences, University of Twente, P.O. Box 217, NL-7500 AE , Enschede, Netherlands

Publication date: 2002-06-15

Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page