Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints.
Imed KacemHans KellererPublished in: Algorithmica (2018)
Keyphrases
- single machine
- maximum lateness
- release times
- scheduling problem
- completion times
- number of late jobs
- processing times
- release dates
- scheduling jobs
- sequence dependent setup times
- single machine scheduling problem
- precedence constraints
- learning effect
- dynamic programming
- deteriorating jobs
- setup times
- approximation algorithms
- response time
- tabu search
- np hard
- parallel machines
- branch and bound algorithm