A faster fully polynomial approximation scheme for the single-machine total tardiness problem Other Scholarly Work

keywords

  • Business & Economics
  • DECOMPOSITION
  • Fully polynomial approximation
  • Management
  • Operations Research & Management Science
  • Science & Technology
  • Single-machine sequencing
  • Social Sciences
  • Technology
  • Total tardiness

WoS ID

  • 000260749100029

Digital Object Identifier (DOI)

start page

  • 637

end page

  • 638

volume

  • 193

issue

  • 2