Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval.
Imed KacemPublished in: Comput. Ind. Eng. (2008)
Keyphrases
- single machine
- competitive ratio
- objective function
- error bounds
- dynamic programming
- learning algorithm
- computational complexity
- scheduling problem
- total weighted tardiness
- worst case
- linear programming
- benchmark problems
- average case
- search space
- np hard
- special case
- knapsack problem
- search procedure
- optimal strategy
- single machine scheduling problem
- approximation ratio
- reinforcement learning