Investigating the recoverable robust single machine scheduling problem under interval uncertainty.

Matthew Bold Marc Goerigk

Published in: Discret. Appl. Math. (2022)

Keyphrases

single machine scheduling problem
weighted tardiness
processing times
release dates
single machine
branch and bound algorithm
hybrid algorithm
resource consumption
response time
computationally efficient
combinatorial optimization
feasible solution
knapsack problem