Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates.
Imed KacemHans KellererPublished in: J. Sched. (2011)
Keyphrases
- approximation algorithms
- release dates
- single machine
- completion times
- minimize total
- precedence constraints
- scheduling problem
- np hard
- job processing times
- single machine scheduling problem
- processing times
- maximum lateness
- sequence dependent setup times
- special case
- total weighted tardiness
- earliness tardiness
- worst case
- scheduling jobs
- release times
- competitive ratio
- setup times
- dynamic programming
- parallel machines
- branch and bound algorithm
- polynomial time approximation
- combinatorial auctions
- lower bound
- computational complexity
- integer programming
- flowshop
- tabu search