Efficient approximation algorithms for the routing open shop problem
Year of publication: |
2013
|
---|---|
Authors: | Chernykh, Ilya ; Kononov, Alexander ; Sevastyanov, Sergey |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 40.2013, 3, p. 841-847
|
Subject: | Theorie | Theory | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Operations Research | Operations research |
-
Nag, Bodhibrata, (2013)
-
Viktorin, Adam, (2022)
-
Human-centric parcel delivery at deutsche post with operations research and machine learning
Arıkan, Uğur, (2023)
- More ...
-
An exact solution with an improved running time for the routing flow shop problem with two machines
Chernykh, Ilya, (2024)
-
Integer preemptive scheduling on parallel machines
Baptiste, Philippe, (2012)
-
A complete 4-parametric complexity classification of short shop scheduling problems
Kononov, Alexander, (2012)
- More ...