Tabu search algorithms for job-shop problems with a single transport robot
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Hurink, J | |
dc.contributor.author | Knust, S | |
dc.date.accessioned | 2021-12-23T16:07:08Z | - |
dc.date.available | 2021-12-23T16:07:08Z | - |
dc.date.issued | 2005 | |
dc.identifier.issn | 03772217 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/7726 | - |
dc.description | 14th Annual Meeting of the European Chapter on Combinatorial Optimization (ECCO 14), Univ Bonn, Bonn, GERMANY, MAY 31-06, 2001-2003 | |
dc.description.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. (C) 2003 Elsevier B.V. All rights reserved. | |
dc.language.iso | en | |
dc.publisher | ELSEVIER SCIENCE BV | |
dc.relation.ispartof | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | |
dc.subject | Business & Economics | |
dc.subject | ENVIRONMENT | |
dc.subject | job-shop problem | |
dc.subject | Management | |
dc.subject | Operations Research & Management Science | |
dc.subject | robot | |
dc.subject | scheduling | |
dc.subject | SCHEDULING PROBLEM | |
dc.subject | tabu search | |
dc.subject | TIMES | |
dc.subject | transportation | |
dc.title | Tabu search algorithms for job-shop problems with a single transport robot | |
dc.type | conference paper | |
dc.identifier.doi | 10.1016/j.ejor.2003.10.034 | |
dc.identifier.isi | ISI:000225176800008 | |
dc.description.volume | 162 | |
dc.description.issue | 1 | |
dc.description.startpage | 99 | |
dc.description.endpage | 111 | |
dc.contributor.orcid | 0000-0001-6986-5633 | |
dc.contributor.researcherid | I-4491-2019 | |
dc.identifier.eissn | 18726860 | |
dc.publisher.place | PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS | |
dcterms.isPartOf.abbreviation | Eur. J. Oper. Res. | |
dcterms.oaStatus | Green Submitted | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | KnSi808 | - |
Seitenaufrufe
3
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 20.05.2024