Login / Signup

A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines.

Halil SenKerem Bülbül
Published in: INFORMS J. Comput. (2015)
Keyphrases
  • scheduling problem
  • parallel machines
  • single machine
  • setup times
  • flowshop
  • lower bound
  • np hard
  • graph cuts
  • sequence dependent setup times