Login / Signup

A new rule for minimizing the number of tardy jobs in dynamic flow shops.

Emmett J. Lodree Jr.Wooseung JangCerry M. Klein
Published in: Eur. J. Oper. Res. (2004)
Keyphrases
  • number of tardy jobs
  • processing times
  • single machine
  • single machine scheduling problem
  • scheduling problem
  • computational complexity
  • association rules
  • special case
  • upper bound