Publication | Closed Access

A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringScheduling ProblemParallel Complexity TheoryComputational ComplexityBound AlgorithmParallel ProgrammingComputer ScienceScheduling (Computing)Discrete MathematicsParallel ComputingCombinatorial OptimizationIdentical Parallel MachineParallel MetaheuristicsOperations Research