Partial servicing of on-line jobs

DOI10.1002/JOS.89zbMATH Open0995.90025OpenAlexW2107738310MaRDI QIDQ1348740FDOQ1348740

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

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

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)

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
• Title not available (Why is that?)
• 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)