Efficient scheduling of periodic information monitoring requests

DOI10.1016/j.ejor.2005.01.057zbMath1109.90313OpenAlexW2010340462MaRDI QIDQ2496080

Hsinchun Chen, Daniel D. Zeng, Moshe Dror

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

schedulinggreedy heuristicsperiodic queries

Mathematics Subject Classification ID

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

Related Items

Exact and heuristic algorithms for thrift cyclic scheduling, Security protection design for deception and real system regimes: a model and analysis, A note on `Efficient scheduling of periodic information monitoring requests'

Uses Software

• PESPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling cyclic tasks with binary periods
• The cyclic compact open-shop scheduling problem
• A new algorithm for scheduling periodic, real-time tasks
• The complexity of multidimensional periodic scheduling
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• The Periodic Loading Problem: Formulation And Heuristics
• A Mathematical Model for Periodic Scheduling Problems
• Scheduling Periodic Tasks
• Scheduling Periodic Tasks with Slack
• Bounds on Multiprocessing Timing Anomalies
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment