Efficient scheduling of periodic information monitoring requests

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

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
Volume173
Issue number2
DOIs
StatePublished - Sep 1 2006

Fingerprint

scheduling
Servers
Server
Scheduling
Monitoring
Query
monitoring
information service
Homelands
source of information
Homeland Security
heuristics
Greedy Heuristics
information system
police
Information Services
National security
Service Quality
Law enforcement
Information services

Keywords

  • Greedy heuristics
  • Periodic queries
  • Scheduling

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Efficient scheduling of periodic information monitoring requests. / Zeng, Dajun; Dror, Moshe; Chen, Hsinchun.

In: European Journal of Operational Research, Vol. 173, No. 2, 01.09.2006, p. 583-599.

Research output: Contribution to journalArticle

@article{97d90847b3664a438360746d8a1aafbe,
title = "Efficient scheduling of periodic information monitoring requests",
abstract = "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.",
keywords = "Greedy heuristics, Periodic queries, Scheduling",
author = "Dajun Zeng and Moshe Dror and Hsinchun Chen",
year = "2006",
month = "9",
day = "1",
doi = "10.1016/j.ejor.2005.01.057",
language = "English (US)",
volume = "173",
pages = "583--599",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Efficient scheduling of periodic information monitoring requests

AU - Zeng, Dajun

AU - Dror, Moshe

AU - Chen, Hsinchun

PY - 2006/9/1

Y1 - 2006/9/1

N2 - 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.

AB - 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.

KW - Greedy heuristics

KW - Periodic queries

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=33646532442&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646532442&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2005.01.057

DO - 10.1016/j.ejor.2005.01.057

M3 - Article

AN - SCOPUS:33646532442

VL - 173

SP - 583

EP - 599

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -