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

J.L. Hurink, S. Knust

Research output: Book/ReportReportOther research output

68 Downloads (Pure)

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.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Faculty of Mathematical Sciences
Number of pages21
Publication statusPublished - 2001

Publication series

NameMemorandum / Department of Applied Mathematics
PublisherUniversity of Twente, Faculty of Mathematical Sciences
No.1579
ISSN (Print)0169-2690

Keywords

  • MSC-90B35
  • IR-65766
  • EWI-3399

Fingerprint Dive into the research topics of 'Tabu search algorithms for job-shop problems with a single transport robot'. Together they form a unique fingerprint.

  • Cite this

    Hurink, J. L., & Knust, S. (2001). Tabu search algorithms for job-shop problems with a single transport robot. (Memorandum / Department of Applied Mathematics; No. 1579). Enschede: University of Twente, Faculty of Mathematical Sciences.