Publication | Closed Access

A binary branch and bound algorithm to minimize maximum scheduling cost

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringComputer ArchitectureComputational ComplexityBranch And CutDiscrete OptimizationOperations ResearchBound AlgorithmParallel ComputingCombinatorial OptimizationComputer EngineeringScheduling (Computing)Computer ScienceInteger ProgrammingBinary BranchScheduling ProblemMaximum Scheduling CostBranch And Bound