On optimal arrangement of stations in a tandem queueing system with blocking
Management Science
Line reversibility of tandem queues with general blocking
Management Science
Simulation modeling with event graphs
Communications of the ACM
Mathematical programming models of discrete event system dynamics
Proceedings of the 32nd conference on Winter simulation
Advanced event scheduling methodology: advanced event scheduling methodology
Proceedings of the 35th conference on Winter simulation: driving innovation
Generating scheduling constraints for discrete event dynamic systems
WSC '04 Proceedings of the 36th conference on Winter simulation
Proceedings of the 38th conference on Winter simulation
Mathematical programming-based perturbation analysis for GI/G/1 queues
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Mathematical programming models of closed tandem queueing networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Simulation optimization with mathematical programming representation of discrete event systems
Proceedings of the 40th Conference on Winter Simulation
Journal of Intelligent Manufacturing
A time-based decomposition algorithm for fast simulation with mathematical programming models
Proceedings of the Winter Simulation Conference
Simulation-optimization of flow lines: an lp-based bounding approach
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
An important class of discrete event systems, tandem queuing 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.