3 citations · 7 across the 13 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016★ 2 cited
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
Maurice Cheung, Julián Mestre, David B. Shmoys +1
We consider the following single-machine scheduling problem, which is often denoted : we are given jobs to be scheduled on a single machine, where each job h…
cs.DS2016
Symmetry exploitation for Online Machine Covering with Bounded Migration
Waldo Gálvez, José A. Soto, José Verschae
Online models that allow recourse are highly effective in situations where classical models are too pessimistic. One such problem is the online machine covering problem on identica…
cs.DS2016
Closing the Gap for Makespan Scheduling via Sparsification Techniques
Klaus Jansen, Kim-Manuel Klein, José Verschae
Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of $n…