The focus of this article is efficient parallelization the canonical polyadic decomposition algorithm utilizing alternating least squares method for sparse tensors on distributed-memory architectures. We propose a hypergraph model general medium-grain partitioning which does not enforce any topological constraint partitioning. proposed based splitting given tensor into nonzero-disjoint componen...

In this paper, a scheduling problem on non-identical parallel machines with auxiliary resources and sequence-dependent machine-dependent setup times is studied. This can be found in various manufacturing contexts, particular workshops of wafer facilities. Three different criteria are defined analyzed: The number products completed before the end given time horizon, weighted sum completion resou...