Name
Affiliation
Papers
J. MACGREGOR SMITH
Department of Mechanical and Industrial Engineering University of Massachusetts MA 01003 Amherst USA
52
Collaborators
Citations 
PageRank 
59
496
61.72
Referers 
Referees 
References 
784
453
479
Search Limit
100784
Title
Citations
PageRank
Year
The Stochastic Queue Core problem, evacuation networks, and state-dependent queues.10.362018
Performance Analysis of Correlated Handover Service in LEO Mobile Satellite Systems.30.432016
Optimal workload allocation in closed queueing networks with state dependent queues30.372015
Performance & Optimization of M/G/c/c Building Evacuation Networks.40.442012
Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems30.412012
Introduction to the special issue on Advances in Manufacturing Systems.00.342011
Optimal Routing In Closed Queueing Networks With State Dependent Queues50.452011
Properties and performance modelling of finite buffer M/G/1/K networks130.632011
Buffer And Server Allocation In General Multi-Server Queueing Networks40.432010
Exact Solution Of Emerging Quadratic Assignment Problems10.382010
Topological network design of general, finite, multi-server queueing networks110.572010
The Multi-Story Space Assignment Problem70.562010
M/G/C/k Performance Models in Manufacturing and Service Systems40.442008
An algorithm for the generalized quadratic assignment problem160.702008
A note on Bayesian identification of change points in data sequences40.692008
Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in Space20.452008
Optimal buffer allocation in finite closed networks with multiple servers100.502008
Multi-Server, Finite Waiting Room, M/G/C/K Optimization Models40.532007
Approximate analysis of M/G/c/c state-dependent queueing networks160.852007
A customer threshold property for closed finite queueing networks10.342006
Service and capacity allocation in M/G/c/c state-dependent queueing networks130.792005
A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space60.712005
An M/G/C/C state-dependent network simulation model221.552005
Dilemmas in factory design: paradox and paradigm00.342005
Stochastic models for the design, coordination, and control of manufacturing systems00.342005
Properties Of R-Sausages00.342004
Steiner Trees and 3-D Macromolecular Conformation20.472004
Combining Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks70.532004
M/G/c/K blocking probability models and system performance331.592003
Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows40.482001
Steiner Minimal Trees with One Polygonal Obstacle00.342001
A multi-period network design problem for cellular telecommunication systems81.012001
Design of cellular networks with diversity and capacity constraints161.502000
Algorithms for a multi-level network optimization problem71.221999
Solving to optimality the uncapacitated fixed-charge network flow problem130.861998
Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models414.201997
Buffer allocation for an integer nonlinear network design problem110.851997
Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E350.491996
Topological Network Design Of State-Dependent Queueing Networks30.681996
Buffer allocation for a class of nonlinear stochastic knapsack problems101.241995
On the Steiner Ratio in 3-Space.00.341995
An O(N-2) Heuristic For Steiner Minimal-Trees In E(3)60.641995
Asymptotic bounds of throughput in series-parallel queueing networks00.341995
On the Steiner ratio in 3-space80.851995
Open finite queueing networks with M/M/C/K parallel servers141.041994
Path-Distance Heuristics for the Steiner Problem in Undirected Networks525.691992
Steiner minimal trees for three points with one convex polygonal obstacle50.761991
Modeling Circulation Systems in Buildings Using State Dependent Queueing Models.253.601989
Buffer space allocation in automated assembly lines303.451988
The Use Of Queuing-Networks And Mixed Integer Programming To Allocate Resources Optimally Within A Library Layout10.951981
  • 1
  • 2