Publication | Closed Access
Minimizing the Weighted Sum of Late and Early Completion Penalties in a Single Machine
31
Citations
11
References
1990
Year
Mathematical ProgrammingEngineeringMachine LearningComputational ComplexityN JobsOperations ResearchWeighted Absolute DeviationSingle MachineSystems EngineeringCombinatorial OptimizationEarly Completion PenaltiesJob SchedulerScheduling (Computing)Computer ScienceWeighted SumStochastic OptimizationScheduling ProblemOptimization ProblemProduction Scheduling
We consider the problem of scheduling n jobs on a single machine so as to minimize weighted absolute deviation of completion times from their due dates. The general problem is NP-complete, but we show how to solve a special case.
| Year | Citations | |
|---|---|---|
Page 1
Page 1