PERIODIC LOADING PROBLEM: FORMULATION AND HEURISTICS.

Paul J. Schweitzer, Moshe Dror, Pierre Trudeau

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

The periodic loading problem involves the allocation of periodically-occurring tasks to the time-slots of a synchronous server in such a way as to minimize the maximum utilization of any time-slot. It arises when a time-division-multiplex communications bus collects data from a collection of periodically-producing sensors, e. g. , the MIL-STD-1553 protocol. This paper formulates the problem, gives bounds on the solution, and shows it contains the minimum makespan problem, hence is NP-complete. Heuristic procedures are given and their performance illustrated on a (actual) problem for which a solution is found within 1% accuracy. In addition, an empirical study for the heuristic procedures is conducted on an extensive set of artificial problems.

Original languageEnglish (US)
Pages (from-to)40-62
Number of pages23
JournalINFOR: Information Systems and Operational Research
Volume26
Issue number1
DOIs
StatePublished - Jan 1 1988
Externally publishedYes

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'PERIODIC LOADING PROBLEM: FORMULATION AND HEURISTICS.'. Together they form a unique fingerprint.

  • Cite this