Properties of discrete event systems from their mathematical programming representations

Author

Chan, Wai Kin ; Schruben, Lee W.

Author_Institution

Dept. of Ind. Eng. nad Operations Res., California Univ., Berkeley, CA, USA

Volume

1

fYear

2003

fDate

7-10 Dec. 2003

Firstpage

496

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.

Keywords

discrete event simulation; discrete event systems; mathematical programming; queueing theory; communication blocking; constraints; discrete event systems; dual network; job makespan; mathematical programming representations; network flow problem; reversibility property; system dynamics; tandem queueing networks; Communication system control; Discrete event systems; Dynamic programming; Industrial engineering; Job production systems; Linear programming; Mathematical model; Mathematical programming; Operations research; Power system modeling;

fLanguage

English

Publisher

ieee

Conference_Titel

Simulation Conference, 2003. Proceedings of the 2003 Winter

Print_ISBN

0-7803-8131-9

Type

conf

DOI

10.1109/WSC.2003.1261461

Filename

1261461