Login / Signup

A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling.

Xiaotie DengHaodi FengPixing ZhangHong Zhu
Published in: ISAAC (2001)
Keyphrases
  • polynomial time approximation
  • np hard
  • error bounds
  • approximation algorithms
  • vertex cover
  • single machine
  • bin packing
  • neural network
  • identical machines
  • supervised learning
  • integer programming
  • classification scheme