No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem
Marcin Mucha (Institute of Informatics, University of Warsaw, Warsaw, Poland), Maxim Sviridenko (Yahoo! Labs, New York, New York)
| Year of publication: |
February 2016
|
|---|---|
| Authors: | Mucha, Marcin ; Sviridenko, Maxim |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 1, p. 247-254
|
| Subject: | approximation | no-wait scheduling | traveling salesman problem | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Heuristik | Heuristics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/moor.2015.0725 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011448378