[1] D.L. Bakuli and J. MacGregor Smith, "Resource allocation in state-dependent emergency evacuation networks," *Eur.J.Oper.Res., *vol. 89, pp. 543-555, 1996.
[2] F. Cruz, E.A. Colosimo and J. MacGregor Smith, "Sample Size Corrections for the Maximum Partial Likelihood Estimator," *Communications in Statistics: Simulation and Computation, *vol. 33, pp. 35-47, 2004.
[3] F.R.B. Cruz and J. MacGregor Smith, "Approximate analysis of M/G/c/c state-dependent queueing networks," *Comput.Oper.Res., *vol. In Press, Corrected Proof,
[4] F.R.B. Cruz, J. MacGregor Smith and R.O. Medeiros, "An M/G/C/C state-dependent network simulation model," *Computers and Operations Research, *vol. 32, pp. 919-941, 2005.
[5] F.R.B. Cruz, J. MacGregor Smith and D.C. Queiroz, "Service and capacity allocation in M/G/c/c state-dependent queueing networks," *Comput.Oper.Res., *vol. 32, pp. 1545-1563, 6. 2005.
[6] F.R.B. Cruz, G.R. Mateus and J. MacGregor
Smith, "A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization
Problem," *Journal of Mathematical Modelling and Algorithms, *vol.
2, pp. 37-56, 03//. 2003.
[7] F.R.B. Cruz, J.M. Smith and G.R. Mateus, "Algorithms for a multi-level network optimization problem," *Eur.J.Oper.Res., *vol. 118, pp. 164-180, 10/1. 1999.
[8] F.R.B. Cruz, J.M. Smith and G.R. Mateus, "Solving to optimality the uncapacitated fixed-charge network flow problem," *Comput.Oper.Res., *vol. 25, pp. 67-81, 1. 1998.
[9] D. Spinellis, C. Papadopoulos, J. MaCgregor Smith, "Large
production line optimization using simulated annealing," *International Journal of Production Research, *vol. 38, pp. 509-541, 2000.
[10] S. Daskalaki and J. MacGregor Smith, "Combining
Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks," *Annals
of Operations Research, *vol. 125, pp. 47-68, 01//. 2004.
[11] J. Dolan, R. Weiss and J. MacGregor Smith, "Minimal
length tree networks on the unit sphere," *Annals of Operations Research, *vol.
33, pp. 501-535, 07//. 1991.
[12] N. Erkip, "In: Stanley B. Gershwin, Yves Dallery, Chrissoleon T. Papadopoulos and J. MacGregor Smith, Editors, Analysis and Modeling of Manufacturing Systems, International Series in OperationsResearch and Management Science, Kluwer Academic Publishers, Boston, Dordrecht, London (2003) ISBN 1-4020-7303-8 429pp., [euro]139.00/ $135.50/[UK pound]87.00," *Oper.Res.Lett., *vol. 33, pp. 219-220, 3. 2005.
[13] H.D. Gosavi and J. MacGregor Smith, "An algorithm for sub-optimal routing in series-parallel queueing networks," *International Journal of Production Research, *vol. 35, pp. 1413-1430, 1997.
[14] H.D. Gosavi and J.M. Smith, "Asymptotic bounds of throughput in series-parallel queueing networks," *Comput.Oper.Res., *vol. 22, pp. 1057-1073, 12. 1995.
[15] Y. Han and J. MacGregor Smith, "Approximate analysis of open M/M/C/K queueing networks," in Proceedings of the 2nd International Conference on Queueing Networks with Finite Capacity, Sep 28-30 1992, 1993, pp. 113.
[16] J. MacGregor Smith, "Evacuation networks," in *Encyclopedia of Optimization, *vol. 29, Floudas C. A. and P.M. Pardalos Eds. Kluwer Academic Publishers, 2001, pp. 36-44.
[17] S. Jain and J.M. Smith, "Open finite queueing networks with M/M/C/K parallel servers," *Comput.Oper.Res., *vol. 21, pp. 297-317, 3. 1994.
[18] L. Kerbache and J. MacGregor Smith, "Asymptotic behavior of the expansion method for open finite queueing networks," *Comput.Oper.Res., *vol. 15, pp. 157-169, 1988.
[19] L. Kerbache and J. MacGregor Smith, "Queueing networks and the topological design of supply chain systems," *Int J Prod Econ, *vol. 91, pp. 251-272, 10/18. 2004.
[20] L. Kerbache and J.M. Smith, "Multi-objective routing within large scale facilities using open finite queueing networks," *Eur.J.Oper.Res., *vol. 121, pp. 105-123, 2/15. 2000.
[21] L. Kerbachea and J. MacGregor Smith, "The generalized expansion method for open finite queueing networks," *Eur.J.Oper.Res., *vol. 32, pp. 448-461, 12. 1987.
[22] S.S. Kolli, "Topological network design : J. MacGregor Smith and P. Winter J.C. Baltzer AG, Basel, 1991, xxii + 612 pages," *Eur.J.Oper.Res., *vol. 71, pp. 143-144, 11/26. 1993.
[23] P. Kubat and J. MacGregor Smith, "A multi-period network design problem for cellular telecommunication systems," *Eur.J.Oper.Res., *vol. 134, pp. 439-456, 2001.
[24] W. Li and J. MacGregor Smith, "Algorithm for Quadratic Assignment Problems," *Eur.J.Oper.Res., *vol. 81, pp. 205-216, 1995.
[25] G. Liberopoulos, C.T. Papadopoulos, B. Tan,
J.M. Smith and S.B. Gershwin, "Stochastic models for the design, coordination,
and control of manufacturing systems," *OR Spectrum, *vol. 27, pp.
167-169, 06//. 2005.
[26] J. MacGregor Smith, "Optimal design and performance modelling of M/G/1/K queueing systems," *Math.Comput.Model., *vol. 39, pp. 1049-1081, 5. 2004.
[27] J. MacGregor Smith, "Cellular arrangement problems with random flows," *Engineering Optimization, *vol. 24, pp. 59, 1995.
[28] J. MacGregor Smith, "State-dependent queueing models in emergency evacuation networks," *Transportation Research Part B: Methodological, *vol. 25, pp. 373-389, 12. 1991.
[29] J. MacGregor Smith, "USE OF QUEUING NETWORKS
AND MIXED INTEGER PROGRAMMING TO ALLOCATE RESOURCES OPTIMALLY WITHIN A LIBRARY
LAYOUT" vol. 32, pp. 33-42, 1981.
[30] J. MacGregor Smith and W. Li, "Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows," *Journal of Combinatorial Optimization, *vol. 5, pp. 421-443, 2001.
[31] J. MacGregor Smith and J.S. Liebman, "STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN," vol. 4, pp. 15-36, 1979.
[32] J. MacGregor Smith, "Dilemmas in factory
design: paradox and paradigm," *OR Spectrum, *vol. 27, pp. 171-193,
06//. 2005.
[33] F.F. Mazzini, G.R. Mateus and J. MacGregor
Smith,ER, "Lagrangean Based Methods for Solving Large-Scale
Cellular Network Design Problems," *Wireless Networks, *vol. 9,
pp. 659-672, 11//. 2003.
[34] E. Melachrinoudis and J.M. Smith, "An O(mn2) algorithm for the Maximin problem in E2," *Oper.Res.Lett., *vol. 18, pp. 25-30, 8. 1995.
[35] D.H. Mitchell and J. MacGregor Smith, "Topological network design of pedestrian networks," *Transportation Research Part B: Methodological, *vol. 35, pp. 107-135, 2. 2001.
[36] M.I. Norbis and J. MacGregor Smith, "A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems," *Eur.J.Oper.Res., *vol. 33, pp. 30-41, 1. 1988.
[37] M. Norbis and J. MacGregor Smith, "Interactive decision support system for the resource constrained scheduling problem," *Eur.J.Oper.Res., *vol. 94, pp. 54-65, 1996.
[38] J.M. Smith, "M/G/c/K blocking probability models and system performance," *Performance Evaluation, *vol. 52, pp. 237-267, 5. 2003.
[39] J.M. Smith, "Application of State-Dependent Queues to Pedestrian/Vehicular Network Design," *Oper.Res., *vol. 42, pp. 414-427, May - Jun. 1994.
[40] J.M. Smith, "Queuing networks and facility planning," *Build.Environ., *vol. 17, pp. 33-45, 1982.
[41] J.M. Smith and B. Bouanaka, "Queuing network decomposition and facilities planning," *Comput.Oper.Res., *vol. 12, pp. 1-16, 1985.
[42] J.M. Smith and N.E. Chikhale, "Buffer
allocation for a class of nonlinear stochastic knapsack problems," *Annals
of Operations Research, *vol. 58, pp. 323-360, 09//. 1995.
[43] J.M. Smith and J.S. Liebman, "An O (n2) heuristic algorithm for the directed Steiner minimal tree problem," *Appl.Math.Model., *vol. 4, pp. 369-375, 10. 1980.
[44] J.M. Smith and B. Toppur, "Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E3," *Discrete Applied Mathematics, *vol. 71, pp. 187-215, 12/5. 1996.
[45] J.M. Smith and M. Gross, "Steiner minimal trees and urban service networks," *Socioecon.Plann.Sci., *vol. 16, pp. 21-38, 1982.
[46] W.D. Smith and J.M. Smith, "On the Steiner ratio in 3-space," *Journal of Combinatorial Theory, Series A, *vol. 69, pp. 301-332, 2. 1995.
[47] K. Talebi and J.M. Smith, "Stochastic network evacuation models," *Comput.Oper.Res., *vol. 12, pp. 559-577, 1985.
[48] B. Toppur and J. MacGregor Smith, "A
Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean
Space," *Journal
of Mathematical Modelling and Algorithms, *vol. 4, pp. 199-217, 06//. 2005.
[49] B. Toppur and J. M. Smith, "Properties
of R-Sausages," *Discrete and Computational Geometry, *vol. 31,
pp. 587-611, 03//. 2004.
[50] J.F. Weng and J. MacGregor Smith, "Steiner Minimal Trees with One Polygonal Obstacle," *Algorithmica (New York), *vol. 29, pp. 638-648, 2001.
[51] P. Winter and J. MacGregor Smith, "Path-distance
heuristics for the Steiner problem in undirected networks," *Algorithmica, *vol.
7, pp. 309-327, 12//. 1992.
[52] P. Winter and J. MacGregor Smith, "Steiner
minimal trees for three points with one convex polygonal obstacle," *Annals
of Operations Research, *vol. 33, pp. 577-599, 07//. 1991.
[53] S.J. Yuhaski and J.M.E.-. Smith, "Modeling
circulation systems in buildings using state dependent queueing models," *Queueing
Systems, *vol. 4, pp. 319-338, 12. 1989.
[54] M. Yuzukirmizi and J.M. Smith, "A customer
threshold property for closed finite queueing networks," *Performance
Evaluation, *vol. In Press, Corrected Proof. |