Technical Note - An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines.
Uttarayan BagchiReza H. AhmadiPublished in: Oper. Res. (1987)
Keyphrases
- lower bound
- sum of completion times
- completion times
- competitive ratio
- single machine
- single machine scheduling problem
- upper bound
- branch and bound algorithm
- scheduling problem
- absolute deviation
- weighted sum
- processing times
- np hard
- branch and bound
- optimal solution
- objective function
- response time
- lower and upper bounds
- flowshop
- worst case
- arrival times
- release times
- lagrangian relaxation
- precedence constraints
- resource allocation
- computational complexity