Clever or smart: strategies for the online target date assignment problem

DOI10.1016/J.DAM.2009.08.014MaRDI QIDQ968114zbMATH OpenOpenAlexFDO

Authors Elisabeth Gassner, Johannes Hatzl, Sven O. Krumke, Sleman Saliba

Publication date 5 May 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2009.08.014

zbMATH Keywords

competitive ratioonline target date assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Approximation and Online Algorithms
• scientific article; zbMATH DE number 1629830
• Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
• A faster algorithm for a due date assignment problem with tardy jobs
• Online facility assignment

Cites work

• Approximation and Online Algorithms
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• Competitive snoopy caching
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Online Algorithms
• Online algorithms. The state of the art
• Online algorithms: a survey

Cited in

(1)

• Approximation and Online Algorithms

This page was built for publication: Clever or smart: strategies for the online target date assignment problem

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