PERIODIC LOADING PROBLEM

FORMULATION AND HEURISTICS.

Paul J. Schweitzer, Moshe Dror, Pierre Trudeau

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

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)
Title of host publicationINFOR: Information Systems and Operational Research
Pages40-62
Number of pages23
Volume26
Edition1
StatePublished - Feb 1988
Externally publishedYes

Fingerprint

Servers
Network protocols
Communication
Sensors

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Schweitzer, P. J., Dror, M., & Trudeau, P. (1988). PERIODIC LOADING PROBLEM: FORMULATION AND HEURISTICS. In INFOR: Information Systems and Operational Research (1 ed., Vol. 26, pp. 40-62)

PERIODIC LOADING PROBLEM : FORMULATION AND HEURISTICS. / Schweitzer, Paul J.; Dror, Moshe; Trudeau, Pierre.

INFOR: Information Systems and Operational Research. Vol. 26 1. ed. 1988. p. 40-62.

Research output: Chapter in Book/Report/Conference proceedingChapter

Schweitzer, PJ, Dror, M & Trudeau, P 1988, PERIODIC LOADING PROBLEM: FORMULATION AND HEURISTICS. in INFOR: Information Systems and Operational Research. 1 edn, vol. 26, pp. 40-62.
Schweitzer PJ, Dror M, Trudeau P. PERIODIC LOADING PROBLEM: FORMULATION AND HEURISTICS. In INFOR: Information Systems and Operational Research. 1 ed. Vol. 26. 1988. p. 40-62
Schweitzer, Paul J. ; Dror, Moshe ; Trudeau, Pierre. / PERIODIC LOADING PROBLEM : FORMULATION AND HEURISTICS. INFOR: Information Systems and Operational Research. Vol. 26 1. ed. 1988. pp. 40-62
@inbook{f025066128a643248f18e54f7229ee65,
title = "PERIODIC LOADING PROBLEM: FORMULATION AND HEURISTICS.",
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.",
author = "Schweitzer, {Paul J.} and Moshe Dror and Pierre Trudeau",
year = "1988",
month = "2",
language = "English (US)",
volume = "26",
pages = "40--62",
booktitle = "INFOR: Information Systems and Operational Research",
edition = "1",

}

TY - CHAP

T1 - PERIODIC LOADING PROBLEM

T2 - FORMULATION AND HEURISTICS.

AU - Schweitzer, Paul J.

AU - Dror, Moshe

AU - Trudeau, Pierre

PY - 1988/2

Y1 - 1988/2

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

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

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

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

M3 - Chapter

VL - 26

SP - 40

EP - 62

BT - INFOR: Information Systems and Operational Research

ER -