Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval.
Imed KacemHans KellererMaryam SeifaddiniPublished in: J. Comb. Optim. (2016)
Keyphrases
- single machine
- maximum lateness
- flowshop
- scheduling problem
- sequence dependent setup times
- scheduling jobs
- approximation schemes
- release dates
- parallel machines
- processing times
- total weighted tardiness
- completion times
- setup times
- release times
- single machine scheduling problem
- precedence constraints
- approximation algorithms
- shortest processing time
- special case
- deteriorating jobs
- numerical methods