Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval.
Imed KacemAli Ridha MahjoubPublished in: Comput. Ind. Eng. (2009)
Keyphrases
- polynomial time approximation
- makespan minimization
- single machine
- identical machines
- np hard
- approximation algorithms
- error bounds
- scheduling problem
- processing times
- minimize total
- total weighted tardiness
- total tardiness
- release dates
- scheduling jobs
- maximum lateness
- earliness tardiness
- sequence dependent setup times
- learning effect
- completion times
- dynamic programming
- release times
- shortest processing time
- number of late jobs
- genetic algorithm
- approximation guarantees
- bin packing
- special case
- evolutionary algorithm