Login / Signup

An Enumerative Algorithm for a Two-Machine Preemptive Job Scheduling with a Learning Effect.

Marcin ZurowskiStanislaw Gawiejnowicz
Published in: MMAR (2018)
Keyphrases
  • dynamic programming
  • computational complexity
  • learning algorithm
  • lower bound
  • job scheduling
  • worst case
  • learning effect
  • databases
  • objective function
  • np hard