Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
James MacGregor Smith
J. MacGregor Smith
2010 – today
- 2012
[j48]Prince Bedell, J. MacGregor Smith: Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems. Computers & OR 39(11): 2800-2819 (2012)
[j47]Alexander Stepanov, James MacGregor Smith: Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms. European Journal of Operational Research 218(3): 775-788 (2012)
[j46]Andrea Weiss, Laurence Williams, J. MacGregor Smith: Performance & Optimization of M/G/c/c Building Evacuation Networks. J. Math. Model. Algorithms 11(4): 361-386 (2012)- 2011
[j45]Tom Van Woensel, John A. Buzacott, Stanley B. Gershwin, George Liberopoulos, J. MacGregor Smith, Semyon M. Meerkov, Baris Tan: Introduction to the special issue on Advances in Manufacturing Systems. Annals OR 182(1): 1-3 (2011)
[j44]J. MacGregor Smith: Properties and performance modelling of finite buffer M/G/1/K networks. Computers & OR 38(4): 740-754 (2011)- 2010
[j43]Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu: The Multi-Story Space Assignment Problem. Annals OR 179(1): 77-103 (2010)
[j42]Frederico R. B. Cruz, Tom Van Woensel, James MacGregor Smith, Kris Lieckens: On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks. European Journal of Operational Research 201(1): 183-193 (2010)
[j41]J. MacGregor Smith, Frederico R. B. Cruz, Tom Van Woensel: Topological network design of general, finite, multi-server queueing networks. European Journal of Operational Research 201(2): 427-441 (2010)
2000 – 2009
- 2009
[j40]Alexander Stepanov, James MacGregor Smith: Multi-objective evacuation routing in transportation networks. European Journal of Operational Research 198(2): 435-446 (2009)
[r1]- 2008
[j39]J. MacGregor Smith: M/G/C/k Performance Models in Manufacturing and Service Systems. APJOR 25(4): 531-561 (2008)
[j38]Peter M. Hahn, Bum-Jin Kim, Monique Guignard, J. MacGregor Smith, Yi-Rong Zhu: An algorithm for the generalized quadratic assignment problem. Comp. Opt. and Appl. 40(3): 351-372 (2008)
[j37]Rosangela Helena Loschi, Frederico R. B. Cruz, Ricardo H. C. Takahashi, Pilar Loreto Iglesias, Reinaldo Boris Arellano-Valle, James MacGregor Smith: A note on Bayesian identification of change points in data sequences. Computers & OR 35(1): 156-170 (2008)
[j36]Mustafa Yuzukirmizi, J. MacGregor Smith: Optimal buffer allocation in finite closed networks with multiple servers. Computers & OR 35(8): 2579-2598 (2008)
[j35]Jia F. Weng, James MacGregor Smith, Marcus Brazil, Doreen A. Thomas: Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in Space. Fundam. Inform. 84(1): 135-149 (2008)- 2007
[j34]Frederico R. B. Cruz, James MacGregor Smith: Approximate analysis of M/G/c/c state-dependent queueing networks. Computers & OR 34(8): 2332-2344 (2007)- 2006
[j33]Mustafa Yuzukirmizi, J. MacGregor Smith: A customer threshold property for closed finite queueing networks. Perform. Eval. 63(4-5): 463-492 (2006)- 2005
[j32]Frederico R. B. Cruz, James MacGregor Smith, R. O. Medeiros: An M/G/C/C state-dependent network simulation model. Computers & OR 32: 919-941 (2005)
[j31]Frederico R. B. Cruz, James MacGregor Smith, D. C. Queiroz: Service and capacity allocation in M/G/c/c state-dependent queueing networks. Computers & OR 32: 1545-1563 (2005)
[j30]Badri Toppur, J. MacGregor Smith: A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space. J. Math. Model. Algorithms 4(2): 199-217 (2005)- 2004
[j29]George Liberopoulos, Baris Tan, Stanley B. Gershwin, C. T. Papadopoulos, James MacGregor Smith: Preface. Annals OR 125(1-4): 17-19 (2004)
[j28]Sophia Daskalaki, J. MacGregor Smith: Combining Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks. Annals OR 125(1-4): 47-68 (2004)
[j27]George Liberopoulos, Baris Tan, Stanley B. Gershwin, C. T. Papadopoulos, James MacGregor Smith: Preface. Annals OR 126(1-4): 17-19 (2004)
[j26]Badri Toppur, J. MacGregor Smith: Properties of R-Sausages. Discrete & Computational Geometry 31(4): 587-611 (2004)
[j25]Courtney Stanton, J. MacGregor Smith: Steiner Trees and 3-D Macromolecular Conformation. INFORMS Journal on Computing 16(4): 470-485 (2004)- 2003
[j24]Frederico R. B. Cruz, Geraldo Robson Mateus, James MacGregor Smith: A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem. J. Math. Model. Algorithms 2(1): 37-56 (2003)
[j23]J. MacGregor Smith: M/G/c/K blocking probability models and system performance. Perform. Eval. 52(4): 237-267 (2003)
[j22]Filipe F. Mazzini, Geraldo Robson Mateus, James MacGregor Smith: Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems. Wireless Networks 9(6): 659-672 (2003)- 2001
[j21]J. F. Weng, J. MacGregor Smith: Steiner Minimal Trees with One Polygonal Obstacle. Algorithmica 29(4): 638-648 (2001)
[j20]Peter Kubat, J. MacGregor Smith: A multi-period network design problem for cellular telecommunication systems. European Journal of Operational Research 134(2): 439-456 (2001)
[j19]J. MacGregor Smith, Wu-Ji Li: Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows. J. Comb. Optim. 5(4): 421-443 (2001)- 2000
[j18]Laoucine Kerbache, James MacGregor Smith: Multi-objective routing within large scale facilities using open finite queueing networks. European Journal of Operational Research 121(1): 105-123 (2000)
1990 – 1999
- 1999
[j17]Frederico R. B. Cruz, J. MacGregor Smith, Geraldo Robson Mateus: Algorithms for a multi-level network optimization problem. European Journal of Operational Research 118(1): 164-180 (1999)- 1998
[j16]Frederico R. B. Cruz, James MacGregor Smith, Geraldo Robson Mateus: Solving to optimality the uncapacitated fixed-charge network flow problem. Computers & OR 25(1): 67-81 (1998)- 1997
[j15]Ajay Singh, J. MacGregor Smith: Buffer allocation for an integer nonlinear network design problem. Computers & OR 24(5): 453-472 (1997)
[j14]Rajat Jain, J. MacGregor Smith: Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models. Transportation Science 31(4): 324-336 (1997)- 1996
[j13]J. MacGregor Smith, Badri Toppur: Euclidean Steiner Minimal Trees, Minimum Energy Configurations, and the Embedding Problem of Weighted Graphs in E3. Discrete Applied Mathematics 71(1-3): 187-215 (1996)
[j12]J. MacGregor Smith: Topological network design of state-dependent queueing networks. Networks 28(1): 55-68 (1996)- 1995
[j11]Hemant D. Gosavi, J. MacGregor Smith: Asymptotic bounds of throughput in series-parallel queueing networks. Computers & OR 22(10): 1057-1073 (1995)
[j10]Warren D. Smith, J. MacGregor Smith: On the Steiner Ratio in 3-Space. J. Comb. Theory, Ser. A 69(2): 301-332 (1995)
[j9]J. MacGregor Smith, Rich Weiss, Minoo Patel: An O(N2) heuristic for steiner minimal trees in E3. Networks 26(4): 273-289 (1995)- 1994
[j8]Sushant Jain, J. MacGregor Smith: Open finite queueing networks with M/M/C/K parallel servers. Computers & OR 21(3): 297-317 (1994)
[j7]Jen Yeng Cheah, James MacGregor Smith: Generalized M/G/C/C state dependent queueing models and pedestrian traffic flows. Queueing Syst. 15(1-4): 365-386 (1994)- 1992
[j6]Pawel Winter, J. MacGregor Smith: Path-Distance Heuristics for the Steiner Problem in Undirected Networks. Algorithmica 7(2&3): 309-327 (1992)
1980 – 1989
- 1989
[j5]S. J. Yuhaski Jr., J. MacGregor Smith: Modeling Circulation Systems in Buildings Using State Dependent Queueing Models. Queueing Syst. 4(4): 319-338 (1989)- 1988
[j4]Laoucine Kerbache, J. MacGregor Smith: Asymptotic behavior of the expansion method for open finite queueing networks. Computers & OR 15(2): 157-169 (1988)- 1985
[j3]J. MacGregor Smith, Bouteldja Bouanaka: Queuing network decomposition and facilities planning. Computers & OR 12(1): 1-16 (1985)
[j2]Kayhan Talebi, James MacGregor Smith: Stochastic network evacuation models. Computers & OR 12(6): 559-577 (1985)- 1981
[j1]J. MacGregor Smith, D. T. Lee, Judith Liebman: An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric. Networks 11(1): 23-39 (1981)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-26 20:08 CET by the dblp team



