The tensor-train (TT) decomposition expresses a tensor in data-sparse format used molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT from various inputs: (1) Parallel-TTSVD for traditional format, (2) PSTT its variants streaming data, (3) Tucker2TT Tucker (4) TT-fADI solutions of Sylvester equat...

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...