Login / Signup

Lot scheduling on a single machine to minimize the (weighted) number of tardy orders.

Baruch MorGur MosheiovDana Shapira
Published in: Inf. Process. Lett. (2020)
Keyphrases
  • scheduling problem
  • computational complexity
  • fixed number
  • number of late jobs
  • single machine