Properties of discrete event systems from their mathematical programming representations

Abstract

An important class of discrete event systems, tandem queueing networks, are considered and formulated as mathematical programming problems where the constraints represent the system dynamics. The dual of the mathematical programming formulation is a network flow problem where the longest path equals the makespan of n jobs. This dual network provides an alternative proof of the reversibility property of tandem queueing networks under communication blocking. The approach extends to other systems.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 25 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.