Publication | Open Access

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Mathematical ProgrammingMaximum CostEngineeringOptimization ProblemComputational ComplexityComputer ScienceDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationDiscrete OptimizationApproximation TheoryPolynomial TimeTotal Completion TimeQuadratic ProgrammingOperations Research