James MacGregor Smith

According to our database1, James MacGregor Smith authored at least 73 papers between 1979 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Finding an optimal core on a tree network with M/G/c/c state-dependent queues.
Math. Methods Oper. Res., 2019

The Stochastic Queue Core problem, evacuation networks, and state-dependent queues.
Eur. J. Oper. Res., 2018

Performance Analysis of Correlated Handover Service in LEO Mobile Satellite Systems.
IEEE Commun. Lett., 2016

Queue decomposition & finite closed queueing network models.
Comput. Oper. Res., 2015

Optimal workload allocation in closed queueing networks with state dependent queues.
Ann. Oper. Res., 2015

Editorial: Stochastic models of manufacturing and service system operations.
Ann. Oper. Res., 2013

Performance & Optimization of M/G/c/c Building Evacuation Networks.
J. Math. Model. Algorithms, 2012

Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms.
Eur. J. Oper. Res., 2012

Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems.
Comput. Oper. Res., 2012

Optimal Routing in Closed Queueing Networks with State Dependent Queues.
INFOR Inf. Syst. Oper. Res., 2011

Properties and performance modelling of finite buffer M/G/1/K networks.
Comput. Oper. Res., 2011

Introduction to the special issue on <i>Advances in Manufacturing Systems</i>.
Ann. Oper. Res., 2011

Buffer and server allocation in general multi-server queueing networks.
Int. Trans. Oper. Res., 2010

Exact solution of emerging quadratic assignment problems.
Int. Trans. Oper. Res., 2010

Topological network design of general, finite, multi-server queueing networks.
Eur. J. Oper. Res., 2010

On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks.
Eur. J. Oper. Res., 2010

The Multi-Story Space Assignment Problem.
Ann. Oper. Res., 2010

Evacuation Networks.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Multi-objective evacuation routing in transportation networks.
Eur. J. Oper. Res., 2009

Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in Space.
Fundam. Informaticae, 2008

Optimal buffer allocation in finite closed networks with multiple servers.
Comput. Oper. Res., 2008

A note on Bayesian identification of change points in data sequences.
Comput. Oper. Res., 2008

An algorithm for the generalized quadratic assignment problem.
Comput. Optim. Appl., 2008

M/G/C/k Performance Models in Manufacturing and Service Systems.
Asia Pac. J. Oper. Res., 2008

Multi-server, Finite Waiting Room, <i>M</i> / <i>G</i> / <i>c</i> / <i>K</i> Optimization Models.
INFOR Inf. Syst. Oper. Res., 2007

Approximate analysis of M/G/c/c state-dependent queueing networks.
Comput. Oper. Res., 2007

A customer threshold property for closed finite queueing networks.
Perform. Evaluation, 2006

Dilemmas in factory design: paradox and paradigm.
OR Spectr., 2005

Stochastic models for the design, coordination, and control of manufacturing systems.
OR Spectr., 2005

A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space.
J. Math. Model. Algorithms, 2005

Service and capacity allocation in M/G/<i>c</i>/<i>c</i> state-dependent queueing networks.
Comput. Oper. Res., 2005

An <i>M</i>/<i>G</i>/<i>C</i>/<i>C</i> state-dependent network simulation model.
Comput. Oper. Res., 2005

Steiner Trees and 3-D Macromolecular Conformation.
INFORMS J. Comput., 2004

Properties of R-Sausages.
Discret. Comput. Geom., 2004

Ann. Oper. Res., 2004

Combining Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks.
Ann. Oper. Res., 2004

Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems.
Wirel. Networks, 2003

M/G/c/K blocking probability models and system performance.
Perform. Evaluation, 2003

A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem.
J. Math. Model. Algorithms, 2003

Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows.
J. Comb. Optim., 2001

A multi-period network design problem for cellular telecommunication systems.
Eur. J. Oper. Res., 2001

Steiner Minimal Trees with One Polygonal Obstacle.
Algorithmica, 2001

Design of cellular networks with diversity and capacity constraints.
IEEE Trans. Reliab., 2000

Multi-objective routing within large scale facilities using open finite queueing networks.
Eur. J. Oper. Res., 2000

Ann. Oper. Res., 2000

Algorithms for a multi-level network optimization problem.
Eur. J. Oper. Res., 1999

Solving to optimality the uncapacitated fixed-charge network flow problem.
Comput. Oper. Res., 1998

Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models.
Transp. Sci., 1997

Buffer allocation for an integer nonlinear network design problem.
Comput. Oper. Res., 1997

Star, grid, ring topologies in facility location & network design.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

Topological network design of state-dependent queueing networks.
Networks, 1996

Euclidean Steiner Minimal Trees, Minimum Energy Configurations, and the Embedding Problem of Weighted Graphs in E<sup>3</sup>.
Discret. Appl. Math., 1996

An O(mn<sup>2</sup>) algorithm for the Maximin problem in E<sup>2</sup>.
Oper. Res. Lett., 1995

An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup>.
Networks, 1995

On the Steiner Ratio in 3-Space.
J. Comb. Theory, Ser. A, 1995

Asymptotic bounds of throughput in series-parallel queueing networks.
Comput. Oper. Res., 1995

Buffer allocation for a class of nonlinear stochastic knapsack problems.
Ann. Oper. Res., 1995

Generalized M/G/C/C state dependent queueing models and pedestrian traffic flows.
Queueing Syst. Theory Appl., 1994

Application of State-Dependent Queues to Pedestrian/Vehicular Network Design.
Oper. Res., 1994

Open finite queueing networks with <i>M/M/C/K</i> parallel servers.
Comput. Oper. Res., 1994

Serial & Parallel Algorithms for QSP Problems.
Proceedings of the Workshop on Parallel Processing of Discrete Optimization Problems, 1994

Stochastic Quadratic Assignment Problems.
Proceedings of the Quadratic Assignment and Related Problems, 1993

Path-Distance Heuristics for the Steiner Problem in Undirected Networks.
Algorithmica, 1992

Steiner minimal trees for three points with one convex polygonal obstacle.
Ann. Oper. Res., 1991

Minimal length tree networks on the unit sphere.
Ann. Oper. Res., 1991

Modeling Circulation Systems in Buildings Using State Dependent Queueing Models.
Queueing Syst. Theory Appl., 1989

Buffer Space Allocation in Automated Assembly Lines.
Oper. Res., 1988

Asymptotic behavior of the expansion method for open finite queueing networks.
Comput. Oper. Res., 1988

Stochastic network evacuation models.
Comput. Oper. Res., 1985

Queuing network decomposition and facilities planning.
Comput. Oper. Res., 1985

An O(<i>n</i> log <i>n</i>) heuristic for steiner minimal tree problems on the euclidean metric.
Networks, 1981

The use of queuing networks and mixed integer programming to allocate resources optimally within a library layout.
J. Am. Soc. Inf. Sci., 1981

Application of Queueing Network Models to Optimization of Resource Allocation within Libraries.
J. Am. Soc. Inf. Sci., 1979