We address various scheduling problems with OR-precedence constraints that are extensions of min-sum set cover, minimum latency set cover and generalized min-sum set cover. Using machinery from the theory of scheduling, we devise new exact and approximative algorithms for variants of these problems. We consider two main objective functions: makespan and total weighted completion time. For the latter objective, we study the relation between min-sum covering problems and OR-scheduling, and we analyze different LP formulations.
«
We address various scheduling problems with OR-precedence constraints that are extensions of min-sum set cover, minimum latency set cover and generalized min-sum set cover. Using machinery from the theory of scheduling, we devise new exact and approximative algorithms for variants of these problems. We consider two main objective functions: makespan and total weighted completion time. For the latter objective, we study the relation between min-sum covering problems and OR-scheduling, and we anal...
»