Introduces TTP with time windows, creates new benchmarks from existing TTP instances, and shows a new heuristic outperforms adapted TSP and TTP methods on many instances.
Maximum number of generations as a stopping criterion considered harmful
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A new series-parallel decomposition algorithm for general DAGs enables task mapping in heterogeneous systems that improves makespan over HEFT variants while running orders of magnitude faster than genetic algorithms or ILPs.
citing papers explorer
-
The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics
Introduces TTP with time windows, creates new benchmarks from existing TTP instances, and shows a new heuristic outperforms adapted TSP and TTP methods on many instances.
-
Static task mapping for heterogeneous systems based on series-parallel decompositions
A new series-parallel decomposition algorithm for general DAGs enables task mapping in heterogeneous systems that improves makespan over HEFT variants while running orders of magnitude faster than genetic algorithms or ILPs.