Article thumbnail

Approximating in exponential time identical parallel machine scheduling with minimum number of tardy jobs

By Federico Della Croce and Vincent T'Kindt

Abstract

International audienc

Topics: [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Publisher: HAL CCSD
Year: 2019
OAI identifier: oai:HAL:hal-03001106v1
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.