Login / Signup

A note on the single machine scheduling to minimize the number of tardy jobs with deadlines.

Cheng HeYixun LinJinjiang Yuan
Published in: Eur. J. Oper. Res. (2010)
Keyphrases
  • single machine scheduling
  • single machine scheduling problem
  • processing times
  • branch and bound algorithm
  • single machine
  • response time
  • lower bound
  • np hard
  • resource consumption