Login / Signup

Non-approximability Results for Scheduling Problems with Minsum Criteria.

Han HoogeveenPetra SchuurmanGerhard J. Woeginger
Published in: IPCO (1998)
Keyphrases
  • scheduling problem
  • min sum
  • np hard
  • approximation algorithms
  • multi criteria
  • goal programming
  • lower bound
  • multiple criteria
  • tabu search
  • special case
  • linear programming