@book{1c99cfefe77d4d1eaa19456006336143,

title = "Tabu search algorithms for job-shop problems with a single transport robot",

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.",

keywords = "MSC-90B35, IR-65766, EWI-3399",

author = "J.L. Hurink and S. Knust",

note = "Imported from MEMORANDA",

year = "2001",

language = "English",

series = "Memorandum / Department of Applied Mathematics",

publisher = "University of Twente, Faculty of Mathematical Sciences",

number = "1579",

}