Approximation results for makespan minimization with budgeted uncertainty.
Marin BougeretKlaus JansenMichael PossLars RohwedderPublished in: CoRR (2019)
Keyphrases
- makespan minimization
- polynomial time approximation
- job shop scheduling problem
- scheduling problem
- parallel machines
- metaheuristic
- processing times
- approximation algorithms
- error bounds
- np hard
- flowshop
- single machine
- special case
- total weighted tardiness
- job shop scheduling
- simulated annealing
- polynomially solvable
- queueing networks
- release dates
- evolutionary algorithm
- theoretical analysis
- linear programming
- setup times