Maximizing job benefits on-line

DOI10.1002/JOS.84zbMATH Open0995.90095OpenAlexW1972404608MaRDI QIDQ1348735FDOQ1348735

Authors: Baruch Awerbuch, Oded Regev, Yossi Azar 

Publication date: 14 May 2002

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.84

Recommendations

• scientific article; zbMATH DE number 1670528
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
• Maximizing job completions online
• The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
• Online Job Admission

zbMATH Keywords

schedulingbenefitflow-timecompetitiveon-linepreemptive

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
• Title not available (Why is that?)
• Minimizing the flow time without migration
• Minimizing mean flow time with release time constraint

Cited In (2)

• Title not available (Why is that?)
• A digitalized employee option

This page was built for publication: Maximizing job benefits on-line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348735)