Login / Signup

Minimizing the number of tardy jobs in two-machine settings with common due date.

Federico Della CroceChristos KoulamasVincent T'kindt
Published in: J. Comb. Optim. (2017)
Keyphrases
  • number of tardy jobs
  • flowshop
  • scheduling problem
  • processing times
  • single machine
  • special case
  • tabu search
  • parallel machines
  • completion times
  • neural network
  • np hard
  • linear programming