Partial servicing of on-line jobs

DOI10.1002/JOS.89MaRDI QIDQ1348740zbMATH OpenOpenAlexFDO

Authors Rob van Stee, Han La Poutré

Publication date 19 June 2002

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

Full work available at URL https://ir.cwi.nl/pub/1888

zbMATH Keywords

competitive ratioquality of serviceon-line scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1670547
• Improved competitive algorithms for online scheduling with partial job values
• Improved competitive algorithms for online scheduling with partial job values
• On-line scheduling of parallel jobs on two machines
• A note on on-line scheduling with partial information

Cites work

• On-Line Scheduling of Imprecise Computations to Minimize Error

Cited in

(4)

• Improved competitive algorithms for online scheduling with partial job values
• On-line service scheduling
• scientific article; zbMATH DE number 1670547 (Why is no real title available?)
• Online service with delay on a line

This page was built for publication: Partial servicing of on-line jobs

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