Cutting-plane algorithms for preemptive uniprocessor scheduling problems.

Published in: Real Time Syst. (2024)

Keyphrases

scheduling problem
cutting plane
processing times
learning algorithm
lower bound
benchmark problems
computational complexity
single machine
flowshop