Publication | Closed Access

A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringParallel Problem SolvingScheduling ProblemParallel Complexity TheoryCompletion TimeParallel ProcessingComputational ComplexityParallel ProgrammingComputer ScienceParallel ComputingCombinatorial OptimizationParallel Identical MachinesParallel MetaheuristicsOperations Research