• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A general scheme for solving a large set of scheduling problems with rejection in FPT time.

Danny HermelinDvir ShabtayChen ZeligMichael L. Pinedo
Published in: J. Sched. (2022)
Keyphrases
  • scheduling problem
  • small number
  • bayesian networks
  • search algorithm
  • special case
  • probability distribution
  • closely related
  • single machine
  • minimum cost
  • parallel machines