Online in-time service problem with minimal server assignment

DOI10.1007/s10878-017-0215-0zbMath1416.90007OpenAlexW2769781412MaRDI QIDQ1740402

Li Luo, Shanxiu Jiang

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

schedulingcompetitive ratioonline algorithmhome health carein-time service

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Online traveling salesman problem with deadlines and service flexibility
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• The online \(k\)-server problem with max-distance objective
• Competitive algorithms for server problems
• An ℴ(log m)-Competitive Algorithm for Online Machine Minimization
• Online traveling salesman problems with rejection options

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