Erratum to "Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval" [Comput. Ind. Eng. 56(2009) 1708-1712].
Imed KacemPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- polynomial time approximation
- makespan minimization
- single machine
- identical machines
- np hard
- approximation algorithms
- scheduling problem
- error bounds
- maximum lateness
- precedence constraints
- minimize total
- total weighted tardiness
- completion times
- scheduling jobs
- earliness tardiness
- number of late jobs
- processing times
- special case
- release times
- total tardiness
- release dates
- objective function
- bin packing
- fixed number
- optimal solution
- shortest processing time
- learning effect
- minimum cost
- weighted sum
- branch and bound algorithm
- constraint satisfaction problems
- worst case
- dynamic programming
- evolutionary algorithm
- lower bound
- weighted number of tardy jobs
- learning algorithm