Efficient scheduling of periodic information monitoring requests

Daniel D. Zeng, Moshe Dror, Hsinchun Chen

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


In many mission-critical applications such as police and homeland security-related information systems, automated monitoring of relevant information sources is essential. Such monitoring results in a large number of periodic queries, which can significantly increase the load on a server that hosts information services. If the execution of these queries is not carefully scheduled on the server, high peak load might occur, leading to degraded service quality. We investigate this query scheduling problem with the objective of minimizing the server's peak load. We state an optimization-based formulation and show that this problem is NP-hard in the strong sense. Subsequently, several greedy heuristic approaches are developed and compared via a computational study with respect to solution quality and computational efficiency.

Original languageEnglish (US)
Pages (from-to)583-599
Number of pages17
JournalEuropean Journal of Operational Research
Issue number2
StatePublished - Sep 1 2006


  • Greedy heuristics
  • Periodic queries
  • Scheduling

ASJC Scopus subject areas

  • General Computer Science
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Efficient scheduling of periodic information monitoring requests'. Together they form a unique fingerprint.

Cite this