Michael Pavlin

Learn More
The multi-processor total tardiness problem (MPTTP) is an AE È-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a number of processors. Exact algorithms like branch and bound have proven to be impractical for the MPTTP, leaving stochastic local search (SLS) algorithms as the main alternative to(More)
  • 1