No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem
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 | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Scheduling-Verfahren | Scheduling problem |
-
The Traveling Salesman Problem with Job-times (TSPJ)
Mosayebi, Mohsen, (2021)
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Self-organisation migration technique for enhancing the permutation coded genetic algorithm
Dinesh, Kamala Kannan, (2021)
- More ...
-
Oczekiwania a konsumpcja - w obliczu przysta̜pienia Polski do Unii Europejskiej
Mucha, Marcin, (2006)
-
Wzrost cen na polskim rynku nieruchomości mieszkaniowych: przyczyny i potencjalne konsekwencje
Mucha, Marcin, (2007)
-
The Mechanism of Economic Divergence in the Euro Area
Mucha, Marcin, (2012)
- More ...