Publication | Closed Access

An approximate decomposition algorithm for scheduling on parallel machines with heads and tails

Mathematical ProgrammingCluster ComputingApproximate Decomposition AlgorithmEngineeringParallel MachinesScheduling ProblemParallel Complexity TheoryComputer EngineeringComputational ComplexityScheduling (Computing)Parallel ProgrammingComputer ScienceParallel ComputingCombinatorial OptimizationParallel MetaheuristicsApproximation TheoryOperations Research