O(log m)-approximation for the routing open shop problem
Year of publication: |
2015
|
---|---|
Authors: | Kononov, Alexander |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 49.2015, 2, p. 383-391
|
Subject: | open shop | routing | approximation algorithms | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Khramova, Antonina P., (2021)
-
Unconstrained traveling tournament problem is APX-complete
Bendayan, Salomon, (2023)
-
An approximation algorithm for the bipartite traveling tournament problem
Hoshino, Richard, (2013)
- More ...
-
A linear time approximation scheme for makespan minimization in an open shop with release dates
Kononov, Alexander, (2002)
-
Complexity and approximability of scheduling resumable proportionally deteriorating jobs
Gawiejnowicz, Stanislaw, (2010)
-
Post-objective determination of weights of the evaluation factors in public procurement tenders
Gawiejnowicz, Stanisław, (2010)
- More ...