Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic.
Imed KacemChengbin ChuPublished in: Int. J. Comput. Integr. Manuf. (2008)
Keyphrases
- single machine
- completion times
- weighted number of tardy jobs
- number of tardy jobs
- worst case
- scheduling jobs
- rolling horizon
- scheduling problem
- processing times
- shortest processing time
- dynamic programming
- minimize total
- total weighted tardiness
- earliness tardiness
- total tardiness
- maximum lateness
- release times
- sequence dependent setup times
- upper bound
- np hard
- lower bound
- setup times
- release dates
- single machine scheduling problem
- number of late jobs
- average case
- competitive ratio
- production scheduling
- learning effect
- approximation algorithms
- error bounds
- optimal solution
- preventive maintenance
- job shop scheduling problem
- strongly np hard
- computational complexity
- combinatorial optimization
- global constraints
- flowshop
- branch and bound algorithm
- constraint programming
- deteriorating jobs
- query processing
- search algorithm