A heuristic for maximizing the number of on-time jobs on two uniform parallel machines Article

Koulamas, Christos, Kyparisis, George J. (2006). A heuristic for maximizing the number of on-time jobs on two uniform parallel machines . NAVAL RESEARCH LOGISTICS, 53(6), 568-575. 10.1002/nav.20161

keywords

  • ALGORITHMS
  • BIN PACKING
  • BOUNDS
  • ORDINAL DATA
  • Operations Research & Management Science
  • PROCESSORS
  • RESOURCE-ALLOCATION
  • SCHEDULES
  • Science & Technology
  • Technology
  • approximation algorithms
  • due dates
  • scheduling
  • uniform parallel machines
  • worst-case bounds

Digital Object Identifier (DOI)

publisher

  • JOHN WILEY & SONS INC

start page

  • 568

end page

  • 575

volume

  • 53

issue

  • 6