On-line scheduling on a single machine: Minimizing the total completion time

DOI10.1007/s002360050162zbMath0940.68008OpenAlexW2043308083MaRDI QIDQ1306569

Amos Fiat, Gerhard J. Woeginger

Publication date: 9 November 1999

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050162

zbMATH Keywords

scheduling problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)

Related Items

Optimally competitive list batching ⋮ Online Appointment Scheduling in the Random Order Model