Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability.
Imed KacemVangelis Th. PaschosPublished in: Discret. Optim. (2013)
Keyphrases
- single machine
- scheduling problem
- minimize total
- processing times
- total weighted tardiness
- release dates
- earliness tardiness
- scheduling jobs
- total tardiness
- maximum lateness
- weighted number of tardy jobs
- production scheduling
- learning effect
- release times
- dynamic programming
- weighted tardiness
- sequence dependent setup times
- rolling horizon
- objective function
- setup times
- approximation algorithms
- competitive ratio
- flowshop
- single machine scheduling problem
- number of late jobs
- identical machines
- supply chain
- np hard
- evolutionary algorithm
- lower bound
- computational complexity
- deteriorating jobs
- genetic algorithm