Online in-time service problem with minimal server assignment

DOI10.1007/S10878-017-0215-0MaRDI QIDQ1740402zbMATH OpenOpenAlexFDO

Authors Shanxiu Jiang, Li Luo

Publication date 30 April 2019

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-017-0215-0

zbMATH Keywords

competitive ratiohome health carein-time serviceonline algorithmscheduling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 7204466
• Online k-server routing problems
• Item:QQ3459911
• Online k-Server Routing Problems
• A competitive 2-server algorithm

Cites work

• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• An \(\mathcal{O}(\log m)\)-competitive algorithm for online machine minimization
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• Competitive algorithms for server problems
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Online traveling salesman problem with deadlines and service flexibility
• Online traveling salesman problems with rejection options
• The online \(k\)-server problem with max-distance objective

This page was built for publication: Online in-time service problem with minimal server assignment

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