We investigate the problem of sequencing jobs that have multiple components. Each component of the job needs to be processed independently on a specified machine. We derive approximate algorithms for the problem of scheduling such vector jobs to minimize their total completion time in the deterministic as well as stochastic setting. In particular, we propose a Linear Programming and a Greedy heuristic based strategy to derive approximate solutions for deterministic and stochastic formulation of the problem.
View Approximate Solutions for Deterministic and Stochastic Multi-Dimensional Sequencing