most citedLearning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2024

Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems

Pascale Bendotti, Luca Brunod Indrigo, Philippe Chrétienne +1

This paper mainly focuses on a resource leveling variant of a two-processor scheduling problem. The latter problem is to schedule a set of dependent UET jobs on two identical proce…