In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the...

In this paper we focus on restrictions arising from the players belonging to some hierarchical structure that is represented by a digraph. Two of these models are the games with a permission structure and games under precedence constraints. In both cases, the hierarchy can be represented by a...

In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the...