Showing 1 - 3 of 3
We consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its predecessors to be completed before it can start. In this...
Persistent link: https://www.econbiz.de/10014501648
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...
Persistent link: https://www.econbiz.de/10012114817
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...
Persistent link: https://www.econbiz.de/10011558733