Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints.
Imed KacemHans KellererPublished in: CoRR (2017)
Keyphrases
- single machine
- maximum lateness
- release times
- scheduling problem
- completion times
- release dates
- processing times
- number of late jobs
- learning effect
- sequence dependent setup times
- single machine scheduling problem
- scheduling jobs
- dynamic programming
- global constraints
- precedence constraints
- setup times
- response time
- deteriorating jobs
- flowshop
- approximation algorithms