Efficient scheduling of periodic information monitoring requests

DOI10.1016/J.EJOR.2005.01.057MaRDI QIDQ2496080zbMATH OpenOpenAlexFDO

Authors Daniel Dajun Zeng, Moshe Dror, Hsinchun Chen

Publication date 30 June 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.01.057

zbMATH Keywords

greedy heuristicsperiodic queriesscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A note on `Efficient scheduling of periodic information monitoring requests'
• The Periodic Loading Problem: Formulation And Heuristics
• Monitoring an information source under a politeness constraint
• General perfectly periodic scheduling
• New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)

Cites work

• A Mathematical Model for Periodic Scheduling Problems
• A new algorithm for scheduling periodic, real-time tasks
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Bounds on Multiprocessing Timing Anomalies
• scientific article; zbMATH DE number 3882509 (Why is no real title available?)
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling cyclic tasks with binary periods
• Scheduling Periodic Tasks
• Scheduling Periodic Tasks with Slack
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• The complexity of multidimensional periodic scheduling
• The cyclic compact open-shop scheduling problem
• The Periodic Loading Problem: Formulation And Heuristics

Cited in

(4)

• Security protection design for deception and real system regimes: a model and analysis
• A note on `Efficient scheduling of periodic information monitoring requests'
• Exact and heuristic algorithms for thrift cyclic scheduling
• Monitoring an information source under a politeness constraint

Describes a project that uses

Uses Software

• PESPLib

This page was built for publication: Efficient scheduling of periodic information monitoring requests

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