@article{
        author={Bakuli,David L. and MacGregor Smith,J.},
        year={1996},
        title={Resource allocation in state-dependent emergency evacuation networks},
        journal={European Journal of Operational Research},
        volume={89},
        number={3},
        pages={543-555},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={Most of the previous studies on the Emergency Evacuation Problem (EEP) assume that the length and widths of the circulation spaces are fixed. This assumption is only true if one is evaluating facilities that are already built. However, when designing the network for the first time, the size of the circulation space is not known to the designer, in fact it is one of several design parameters. After the routes have been established, it seems that the next logical question is to find out whether or not the system circulation spaces are capable of accommodating the traffic for both normal circulation and in an emergency. The problem of designing emergency evacuation networks is very complex and it is only recently that queueing networks are now being used to model this problem. Recent advances include state-dependent queueing network models that incorporate the mean value analysis algorithm to capture the non-linearities in the problem. We extend these models by incorporating the mean value analysis algorithm within Powell's derivative free unconstrained optimization algorithm. The effect of varying circulation widths on throughput will be discussed and a methodology for solving the resource allocation problem is proposed and demonstrated on several examples. The computational experience of the new methodology illustrates its usefulness in network design problems.},
        keywords={Resource allocation; Mathematical models; Algorithms; Optimization; Planning; Queueing theory},
        isbn={0377-2217},
        url={http://dx.doi.org/10.1016/0377-2217(94)00230-4},
@article{
        author={Cruz,F. and Colosimo,E. A. and MacGregor Smith,J.},
        year={2004},
        title={Sample Size Corrections for the Maximum Partial Likelihood Estimator},
        journal={Communications in Statistics: Simulation and Computation},
        volume={33},
        number={1},
        pages={35-47},
        abstract={n this paper, resampling methods, namely the jackknife and the bootstrap, are considered for bias evaluation and correction of maximum partial likelihood estimators. A complete set of Monte Carlo simulations compare the proposed approaches with formulae recently proposed for bias correction to order n −1. The results indicate a competitive performance for these methods.},
        url={http://www.journalsonline.tandf.co.uk/openurl.asp?genre=article&id=doi:10.1081/SAC-120028432},
@article{
        author={Cruz,F. R. B. and MacGregor Smith,J.},
        title={Approximate analysis of M/G/c/c state-dependent queueing networks},
        journal={Computers & Operations Research},
        volume={In Press, Corrected Proof},
        abstract={Congestion is ever present in most practical situations. We describe a methodology for approximate analysis of open state-dependent M/G/c/c queueing networks in which the service rate is subject to congestion, that is, it is a function of the number of customers in the system. Important performance measurements are easily computed with high accuracy, such as the blocking probability, throughput, expected number of customers in the system (known also as work-in-process), and expected waiting time. The methodology forms a basic building block useful in many practical applications and contexts. Computational results demonstrate that the methodology provides accurate results in many topological configurations as well as in the analysis of network evacuation problems in high-rise buildings.},
@article{
        author={Cruz,F. R. B. and MacGregor Smith,J. and Medeiros,R. O.},
        year={2005},
        title={An M/G/C/C state-dependent network simulation model},
        journal={Computers and Operations Research},
        volume={32},
        number={4},
        pages={919-941},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={A discrete-event digital simulation model is developed to study traffic flows in M/G/C/C state-dependent queueing networks. Several performance measures are evaluated, namely (i) the blocking probability, (ii) throughput, (iii) the expected number of the customers in the system, and (iv) expected travel (service) time. Series, merge, and split topologies are examined with special application to pedestrian planning evacuation problems in buildings. Extensive computational experiments are presented showing that the simulation model is an effective and insightful tool to validate analytical expressions and also to analyze general accessibility in network evacuation problems especially in high-rise buildings. © 2003 Elsevier Ltd. All rights reserved.},
        keywords={Customer satisfaction; Telecommunication traffic; Topology; Markov processes; Probability; Computer simulation; Queueing networks},
        isbn={0305-0548},
        url={http://dx.doi.org/10.1016/j.cor.2003.09.006},
@article{
        author={Cruz,F. R. B. and MacGregor Smith,J. and Queiroz,D. C.},
        year={2005},
        month={6},
        title={Service and capacity allocation in M/G/c/c state-dependent queueing networks},
        journal={Computers & Operations Research},
        volume={32},
        number={6},
        pages={1545-1563},
        abstract={The problem of service and capacity allocation in state-dependent M/G/c/c queueing networks is analyzed and algorithms are developed to compute the optimal allocation c. The model is applied to the modeling of pedestrian circulation systems and basic series, merge, and split topologies are examined. Also of interest are applications to problems of evacuation planning in buildings. Computational experiments assert the algorithm's speed, robustness, and effectiveness. The results obtained indicate that the pattern of the optimal capacity surprisingly repeats over different topologies and it is also heavily dependent upon the arrival rate. Additional computational simulation results are provided to show the accuracy of the approach in all configurations tested.},
@article{
        author={Cruz,F. R. B. and Mateus,G. R. and MacGregor Smith,J. E. -.},
        year={2003},
        month={03//},
        title={A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem},
        journal={Journal of Mathematical Modelling and Algorithms},
        volume={2},
        number={1},
        pages={37-56},
@article{
        author={Cruz,F. R. B. and Smith,J. M. and Mateus,G. R.},
        year={1999},
        month={10/1},
        title={Algorithms for a multi-level network optimization problem},
        journal={European Journal of Operational Research},
        volume={118},
        number={1},
        pages={164-180},
        abstract={In this paper we work on a multi-level network optimization problem that integrates into the same model important aspects of: (i) discrete facility location, (ii) topological network design, and (iii) network dimensioning. Potential applications for the model are discussed, stressing its growing importance. The multi-level network optimization problem treated is defined and a mathematical programming formulation is presented. We make use of a branch-and-bound algorithm based on Lagrangean relaxation lower bounds to introduce some new powerful auxiliary algorithms to exactly solve the problem. We conduct a set of computational experiments that indicate the quality of the proposed approach.},
@article{
        author={Cruz,F. R. B. and Smith,J. M. and Mateus,G. R.},
        year={1998},
        month={1},
        title={Solving to optimality the uncapacitated fixed-charge network flow problem},
        journal={Computers & Operations Research},
        volume={25},
        number={1},
        pages={67-81},
        abstract={We present the uncapacitated fixed-charge network flow problem and two mathematical programming formulations. We use an exact approach to solve the problem, the well-known branch-and-bound algorithm. We derive bounds for the algorithm using Lagrangean Relaxation and also propose an efficient branching strategy which is based on an important property of the optimal solution. We also use a Lagrangean Relaxation of the problem to develop a new reduction test. The practical efficiency of all the procedures is demonstrated through a comprehensive set of computational experiments.},
@article{
        author={D. Spinellis, C. Papadopoulos, J. MaCgregor Smith},
        year={2000},
        title={Large production line optimization using simulated annealing},
        journal={International Journal of Production Research},
        volume={38},
        number={3},
        pages={509-541},
        abstract={We present a robust generalized queuing network algorithm as an evaluative procedure for optimizing production line configurations using simulated annealing. We compare the results obtained with our algorithm to those of other studies and find some interesting similarities but also striking differences between them in the allocation of buffers, numbers of servers, and their service rates. While context dependent, these patterns of allocation are one of the most important insights which emerge in solving very long production lines. The patterns, however, are often counter-intuitive, which underscores the difficulty of the problem we address. The most interesting feature of our optimization procedure is its bounded execution time, which makes it viable for optimizing very long production line configurations. Based on the bounded execution time property, we have optimized configurations of up to 60 stations with 120 buffers and servers in less than five hours of CPU time.},
        url={http://taylorandfrancis.metapress.com/openurl.asp?genre=article&id=doi:10.1080/002075400189284},
@article{
        author={Daskalaki,Sophia and MacGregor Smith,J. E. -.},
        year={2004},
        month={01//},
        title={Combining Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks},
        journal={Annals of Operations Research},
        volume={125},
        number={1 - 4},
        pages={47-68},
@article{
        author={Dolan,John and Weiss,Richard and MacGregor Smith,J. E. -.},
        year={1991},
        month={07//},
        title={Minimal length tree networks on the unit sphere},
        journal={Annals of Operations Research},
        volume={33},
        number={7},
        pages={501-535},
@article{
        author={Erkip,Nesim},
        year={2005},
        month={3},
        title={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},
        journal={Operations Research Letters},
        volume={33},
        number={2},
        pages={219-220},
@article{
        author={Gosavi,H. D. and MacGregor Smith,J.},
        year={1997},
        title={An algorithm for sub-optimal routing in series-parallel queueing networks},
        journal={International Journal of Production Research},
        volume={35},
        number={5},
        pages={1413-1430},
        abstract={The optimal routeing problem of maximizing system throughput in series-parallel networks with finite buffers is studied in this paper. The problem is extremely difficult to solve since closed form expressions are not easily constructed for throughput in finite networks. A piece-wise linear upper bound on the throughput of a tandem network is used to develop a throughput approximation in seriesparallel networks. Based on this approximation we are able to specify a suboptimal range for routeing probabilities at each junction in the network as a function of the arrival rate to this junction. We also specify a unique value for the routeing probability at each junction, independent of the arrival rate to that junction. We then construct an O(N) algorithm to analyse general series-parallel networks with more than one junction and specify the sub-optimal routeing probabilities at each junction.},
        url={http://www.journalsonline.tandf.co.uk/openurl.asp?genre=article&id=doi:10.1080/002075497195399},
@article{
        author={Gosavi,Hemant D. and Smith,J. M.},
        year={1995},
        month={12},
        title={Asymptotic bounds of throughput in series-parallel queueing networks},
        journal={Computers & Operations Research},
        volume={22},
        number={10},
        pages={1057-1073},
        abstract={We propose a piece-wise linear upper bound on the throughput rate from a network of series-parallel queues where arrivals occur through a single infinite queue. This bound is tight and is observed to be extremely accurate in forecasting the actual throughput rate. We also describe the monotonicity of throughput as a function of the arrival rate and specify a condition under which the upper bound may be computed. We approximate analytically the throughput measured as a function of the arrival rate for two tandem exponential queues, where the first queue has an infinite buffer while the second queue has a finite buffer. We extend this analysis to elementary split and merge queueing networks. We demonstrate the generality and robustness of this asymptotic property, for larger series-parallel networks with general service times and specify the set up of a single simulation experiment which can be used to retrieve the throughput for any arrival rate, as well as other networks performance measures.},
@inproceedings{
        author={Han,Y. and MacGregor Smith,J.},
        editor={ },
        year={1993},
        title={Approximate analysis of open M/M/C/K queueing networks},
        booktitle={Proceedings of the 2nd International Conference on Queueing Networks with Finite Capacity, Sep 28-30 1992},
        series={Proceedings of the International Conference on Queueing Networks with Finite Capacity},
        publisher={Publ by Elsevier Science Publishers B.V., Amsterdam, Neth},
        address={Research Triangle Park, NC, USA},
        organization={Univ of Massachusetts-Amherst, MA, USA},
        pages={113},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        isbn={0-444-89772-0},
@inbook{
        author={J. MacGregor Smith},
        editor={Floudas C. A. and Pardalos,P. M.},
        year={2001},
        title={Evacuation networks},
        series={Encyclopedia of Optimization},
        publisher={Kluwer Academic Publishers},
        volume={29},
        pages={36-44},
@article{
        author={Jain,Sushant and Smith,J. M.},
        year={1994},
        month={3},
        title={Open finite queueing networks with M/M/C/K parallel servers},
        journal={Computers & Operations Research},
        volume={21},
        number={3},
        pages={297-317},
        abstract={The modelling and design of facility, telecommunication, service and manufacturing systems as open, finite queueing networks are extended to include multi-server M/M/C/K servers. An analytical approximation technique is utilized to calculate system performance measures of each M/M/C/K queue. Series, merge, and splitting topologies are analyzed and it is shown that the analytical technique applies to arbitrarily configured series-parallel network topologies. In addition, we explore the optimal order of these M/M/C/K servers in these systems.},
@article{
        author={Kerbache,Laoucine and MacGregor Smith,J.},
        year={1988},
        title={Asymptotic behavior of the expansion method for open finite queueing networks},
        journal={Computers & Operations Research},
        volume={15},
        number={2},
        pages={157-169},
        abstract={In previous papers, we have reported on the use of the expansion method for estimating sojourn times in finite network topologies. In this paper, we focus on comparing the expansion method with P. C. Bell's consistency conditions where subject to unbalanced service rates at tandem queues, other decomposition approaches yield impossible throughput results. We compare numerical results of the expansion method with the other approaches in light of these conditions.},
@article{
        author={Kerbache,Laoucine and MacGregor Smith,James},
        year={2004},
        month={10/18},
        title={Queueing networks and the topological design of supply chain systems},
        journal={International Journal of Production Economics},
        volume={91},
        number={3},
        pages={251-272},
        abstract={Manufacturing firms are linking their internal processes to external suppliers and customers. The resulting supply chain is often a very large network of activities and resources. Modeling and optimization of such complex systems is a new area of research for which exact analytical results are obviously very difficult if not impossible.We develop a methodology based on analytical queueing networks coupled with nonlinear optimization to design supply chain topologies and evaluate various performance measures. The results obtained from small network configurations as well as from the case study discussed in the paper demonstrate that our approach is a very useful tool to analyze congestion problems and to evaluate the performance of the network topologies.},
@article{
        author={Kerbache,Laoucine and Smith,J. M.},
        year={2000},
        month={2/15},
        title={Multi-objective routing within large scale facilities using open finite queueing networks},
        journal={European Journal of Operational Research},
        volume={121},
        number={1},
        pages={105-123},
        abstract={The major objective of this paper is to examine the optimal routing in layout and location problems from a network optimization perspective where manufacturing facilities are modelled as open finite queueing networks with a multi-objective set of performance measures. The overall material handling system is broken down into a set of layout topologies. For each one of these topologies the optimal routing is determined so that the product throughput is maximized while minimizing the average sojourn time and holding costs. An approximate analytical decomposition technique for modelling open finite queueing networks, called the Generalized Expansion Method (GEM), developed by the authors, is utilized to calculate the desired outputs. A mathematical optimization procedure which is described in this paper is then used to determine the optimal routes. As will be demonstrated, the design methodology of combining the optimization and analytical queueing network models provides a very effective procedure for evaluating alternative topologies while simultaneously determining the average sojourn times and the maximum throughputs of the best routes.},
@article{
        author={Kerbachea,Laoucine and MacGregor Smith,J.},
        year={1987},
        month={12},
        title={The generalized expansion method for open finite queueing networks},
        journal={European Journal of Operational Research},
        volume={32},
        number={3},
        pages={448-461},
        abstract={Blocking makes the exact analytical analysis of open queueing networks with finite capacities intractable except for very small networks, therefore, approximation approaches are needed to analyze these types of networks. For exponential open finite queueing networks, some methods have been proposed but little has been done so far on nonexponential open finite queueing networks. This paper introduces a new approximation technique for the analysis of general open finite queueing networks. Extensive numerical examples are performed for different network topologies and the results are compared with simulation.},
@article{
        author={Kolli,Sai S.},
        year={1993},
        month={11/26},
        title={Topological network design : J. MacGregor Smith and P. Winter J.C. Baltzer AG, Basel, 1991, xxii + 612 pages},
        journal={European Journal of Operational Research},
        volume={71},
        number={1},
        pages={143-144},
@article{
        author={Kubat,P. and MacGregor Smith,J.},
        year={2001},
        title={A multi-period network design problem for cellular telecommunication systems},
        journal={European Journal of Operational Research},
        volume={134},
        number={2},
        pages={439-456},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={Mathematical Programming models for multi-period network design problems, which arise in cellular telecommunication systems are presented. The underlying network topologies range from a simple star to complex multi-layer Steiner-like networks. Linear programming, Lagrangian relaxation, and branch-and-cut heuristics are proposed and a polynomial-bounded heuristic based on an interior point linear programming implementation is described. Extensive computational results are presented on a number of randomly generated problem sets and the performance of the heuristic(s) are compared with an optimal branch-and-bound algorithm. © 2001 Elsevier Science B.V. All rights reserved.},
        keywords={Cellular radio systems; Telecommunication networks; Lagrange multipliers; Linear programming; Heuristic methods; Polynomials; Computational methods; Random number generation; Algorithms; Relaxation processes; Operations research},
        isbn={0377-2217},
        url={http://dx.doi.org/10.1016/S0377-2217(00)00271-X},
@article{
        author={Li,Wu-Ji and MacGregor Smith,J.},
        year={1995},
        title={Algorithm for Quadratic Assignment Problems},
        journal={European Journal of Operational Research},
        volume={81},
        number={1},
        pages={205-216},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={Facility layout and location problems with stochastic congestion in the traffic circulation system have been studied in a previous paper. In this paper, we present a heuristic algorithm to solve these complex problems. With its straight forward approach, the algorithm can solve large-scale Quadratic Assignment Problems with reasonable computing times and efficient performance. Computational experience for solving many test examples is also presented.},
        keywords={Site selection; Location; Random processes; Sampling; Heuristic programming; Algorithms; Large scale systems; Mathematical models; Plant layout},
        isbn={0377-2217},
        url={http://dx.doi.org/10.1016/0377-2217(93)E0162-Q},
@article{
        author={Liberopoulos,G. and Papadopoulos,C. T. and Tan,B. and Smith,J. M. and Gershwin,S. B. E. -.},
        year={2005},
        month={06//},
        title={Stochastic models for the design, coordination, and control of manufacturing systems},
        journal={OR Spectrum},
        volume={27},
        number={2 - 3},
        pages={167-169},
@article{
        author={MacGregor Smith,J.},
        year={2004},
        month={5},
        title={Optimal design and performance modelling of M/G/1/K queueing systems},
        journal={Mathematical and Computer Modelling},
        volume={39},
        number={9-10},
        pages={1049-1081},
        abstract={Approximating the performance measures of M/G/1/K systems is a difficult, challenging, and important problem for applications in science and engineering. An approach based on a two-moment approximation of the process is presented and is contrasted with an embedded Markov chain approach, Gelenbe's approach, simulation, and finally, the statistics of M/M/1/K systems. The closed form expressions for the different performance measures should be very handy. The use of the approximation in the performance modelling and design of M/G/1/K systems is also explored in order to demonstrate the practical usefulness of the concepts contained within the paper.},
@article{
        author={MacGregor Smith,J.},
        year={1995},
        title={Cellular arrangement problems with random flows},
        journal={Engineering Optimization},
        volume={24},
        number={1},
        pages={59},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        isbn={0305-215X},
@article{
        author={MacGregor Smith,J.},
        year={1991},
        month={12},
        title={State-dependent queueing models in emergency evacuation networks},
        journal={Transportation Research Part B: Methodological},
        volume={25},
        number={6},
        pages={373-389},
        abstract={Planning and design of evacuation networks is both a complex and critically important problem for a number of emergency situations. One particularly critical class of examples concerns the emergency evacuation of chemical plants, high-rise buildings, and naval vessels due to fire, explosion or other emergency. The problem is a highly transient, stochastic, nonlinear, integer programming problem and previous methodologies utilizing queueing network models have proved useful in the design of emergency evacuation plans. We enhance this class of queueing network models by adding state-dependent queueing models to capture the nonlinear effects of increased occupant traffic flow along emergency evacuation routes. A mean value analysis algorithm and computational experience of the methodology illustrates our model's usefulness for this class of network design problems.},
@article{
        author={MacGregor Smith,J.},
        year={1981},
        title={USE OF QUEUING NETWORKS AND MIXED INTEGER PROGRAMMING TO ALLOCATE RESOURCES OPTIMALLY WITHIN A LIBRARY LAYOUT},
        volume={32},
        number={1},
        pages={33-42},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={Queueing networks, mixed integer programming, and expected utility theory are combined to model effectively the library building programming problem. The model is utilized with empirical data to allocate activities, equipment, and staff optimally within a library layout.},
        keywords={OPERATIONS RESEARCH - Applications; MATHEMATICAL PROGRAMMING - Applications; INFORMATION SERVICES; PROBABILITY - Queueing Theory; LIBRARIES},
        isbn={0002-8231},
@article{
        author={MacGregor Smith,J. and Li,Wu-Ji},
        year={2001},
        title={Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows},
        journal={Journal of Combinatorial Optimization},
        volume={5},
        number={4},
        pages={421-443},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={One of the most notorious network design problems is the Quadratic Assignment Problem (QAP). We develop an heuristic algorithm for QAPs along with an M/G/C/C state dependent queueing model for capturing congestion in the traffic system interconnecting the nodes in the network. Computational results are also presented.},
        isbn={1382-6905},
        url={http://dx.doi.org/10.1023/A:1011624708694},
@article{
        author={MacGregor Smith,J. and Liebman,Judith S.},
        year={1979},
        title={STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN},
        volume={4},
        number={1},
        pages={15-36},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={Buildings contain enormously complex configurations of corridors, pipes, ducts, conduits and related building system components. In many cases, the configuration and analysis of these component systems can be formulated as the Steiner tree problem with and without obstacles. Certain building systems can be represented with a Euclidean metric while others are best defined with a rectilinear (Manhattan) metric. The paper describes heuristic algorithms for the interactive development of minimal Steiner trees and circuits. The interactive approach enables architects and engineers to design these systems in ways consistent with the designed arrangement of building activities in two and three dimensions.},
        keywords={OPTIMIZATION; BUILDING},
        isbn={0305-215X},
@article{
        author={MacGregor Smith,J. E. -.},
        year={2005},
        month={06//},
        title={Dilemmas in factory design: paradox and paradigm},
        journal={OR Spectrum},
        volume={27},
        number={2 - 3},
        pages={171-193},
@article{
        author={Mazzini,Filipe F. and Mateus,Geraldo R. and Smith,James MacGregor ER -},
        year={2003},
        month={11//},
        title={Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems},
        journal={Wireless Networks},
        volume={9},
        number={6},
        pages={659-672},
@article{
        author={Melachrinoudis,Emanuel and Smith,J. M.},
        year={1995},
        month={8},
        title={An O(mn2) algorithm for the Maximin problem in E2},
        journal={Operations Research Letters},
        volume={18},
        number={1},
        pages={25-30},
        abstract={An O(mn2) algorithm is developed in this paper for the Euclidean weighted Maximin problem using the weighted Voronoi diagram in the plane.},
@article{
        author={Mitchell,David H. and MacGregor Smith,J.},
        year={2001},
        month={2},
        title={Topological network design of pedestrian networks},
        journal={Transportation Research Part B: Methodological},
        volume={35},
        number={2},
        pages={107-135},
        abstract={The design and analysis of series, merge, and splitting topologies of pedestrian networks is presented and an analytical approximation methodology is developed to compute the network performance measures. State dependent queuing networks are appropriate tools for modelling congestion in vehicular and pedestrian traffic networks, and many others where congestion occurs due to a decay in the service rate with increased density of customer traffic. This paper focuses on models for pedestrian network design. Also, an optimization methodology is developed for determining the optimal capacity requirements of these networks and extensive experimental results are included.},
@article{
        author={Norbis,Mario I. and MacGregor Smith,J.},
        year={1988},
        month={1},
        title={A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems},
        journal={European Journal of Operational Research},
        volume={33},
        number={1},
        pages={30-41},
        abstract={The problem of planning, scheduling, and controlling manufacturing operations over time where constraints on available resources exist e.g. (workstations, labor, facilities, materials and equipment) is a difficult mathematical programming problem. The Resource Constrained Scheduling Problem (RCSP) as it is often referred to, is known to be NP-complete which necessitates the creation of heuristics. In this paper, a multi-level, multi-priority schema is presented which enables the user to deal with static environments but places special emphasis on quasi-dynamic scheduling environments. The polynomial time and space complexity of the heuristic together with the computational experience demonstrate the effectiveness of the quasi-dynamic heuristic.},
@article{
        author={Norbis,Mario and MacGregor Smith,J.},
        year={1996},
        title={Interactive decision support system for the resource constrained scheduling problem},
        journal={European Journal of Operational Research},
        volume={94},
        number={1},
        pages={54-65},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={One of the most demanding managerial decision making problems is the assignment of scarce resources to activities over time to optimize some measure of performance. For a version of this problem known as the Resource Constrained Scheduling Problem, Norbis and Smith have developed dynamic heuristics. In this paper an interactive schema is presented that allows the Decision Maker to change the relative priority of the jobs as well as the priority rules. Experimental results are presented with the interactive DSS for comparing alternative scheduling rules.},
        keywords={Decision support systems; Resource allocation; Scheduling; Constraint theory; Optimization; Performance; Heuristic methods; Interactive computer systems},
        isbn={0377-2217},
        url={http://dx.doi.org/10.1016/0377-2217(95)00187-5},
@article{
        author={Smith,J. M.},
        year={2003},
        month={5},
        title={M/G/c/K blocking probability models and system performance},
        journal={Performance Evaluation},
        volume={52},
        number={4},
        pages={237-267},
        abstract={An exact solution for the M/G/c/K model is only possible for special cases, such as exponential service, a single server, or no waiting room at all. Instead of basing the approximation on an infinite capacity queue as is often the case, an approximation based on a closed-form expression derivable from the finite capacity exponential queue is presented. Properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed. Extensive experiments are provided to test and verify the efficacy of our approximate results.},
@article{
        author={Smith,J. M.},
        year={1994},
        month={May - Jun.},
        title={Application of State-Dependent Queues to Pedestrian/Vehicular Network Design},
        journal={Operations research},
        volume={42},
        number={3},
        pages={414-427},
        note={ID: 24; GR: OR Practice},
        abstract={State-dependent queues and finite capacity queueing network models of facilities are important tools for the topological design of facilities, the routing of customers, and the allocation of resources to accommodate customer traffic. Key properties of these M/G/C/C queueing models and their applications in facility planning are described in detail. The incorporation of these concepts, tools, and techniques is important to the OR profession because they provide a unifying, system-wide planning methodology for tackling the many complex issues of designing, analyzing, and synthesizing pedestrian traffic flows in large-scale facilities and their environments. The scope and limitations of the methodology are demonstrated in the design of a pedestrian/vehicular circulation system of a large regional hospital campus.},
        keywords={Facilities/equipment planning: layout; routing and resource allocation; Queues; networks: state-dependent queues; OR Practice},
        isbn={0030364x},
        url={http://links.jstor.org/sici?sici=0030-364X%28199405%2F06%2942%3A3%3C414%3AAOSQTP%3E2.0.CO%3B2-V},
@article{
        author={Smith,J. M.},
        year={1982},
        title={Queuing networks and facility planning},
        journal={Building and Environment},
        volume={17},
        number={1},
        pages={33-45},
        abstract={Open, closed, and mixed networks of queues are shown to be viable techniques for modelling public buildings. The optimal access and egress problems of public buildings together with the necessary assumptions, concepts and mathematical details for employing these queuing network models are presented. The paper concludes with an example comparison of a single-story and a three-story public building modelled as a queuing network. The demonstration indicates how queuing networks can quantify system bottlenecks, measures of congestion and overall sojourn time for the different customer classes intent on utilizing the facility.},
@article{
        author={Smith,J. M. and Bouanaka,Bouteldja},
        year={1985},
        title={Queuing network decomposition and facilities planning},
        journal={Computers & Operations Research},
        volume={12},
        number={1},
        pages={1-16},
        abstract={We have shown previously that open, closed, and mixed networks of queues are viable means of analyzing the configuration and composition of resources in facility layout problems. In this paper, we explore the scope and limitations of decomposition techniques for modelling general arrival and service processes M/G/C, M/D/C and GI/G/C within facilities. The robustness of our analytical approach is then compared with a simulation analysis of an example facility.},
@article{
        author={Smith,J. M. and Chikhale,Nikhil E. -.},
        year={1995},
        month={09//},
        title={Buffer allocation for a class of nonlinear stochastic knapsack problems},
        journal={Annals of Operations Research},
        volume={58},
        number={5},
        pages={323-360},
@article{
        author={Smith,J. M. and Liebman,Judith S.},
        year={1980},
        month={10},
        title={An O (n2) heuristic algorithm for the directed Steiner minimal tree problem},
        journal={Applied Mathematical Modelling},
        volume={4},
        number={5},
        pages={369-375},
        abstract={This paper describes the design of an O(N2) heuristic algorithm for the Directed Steiner Minimal Tree (DSMT) problem in the plane. The algorithm employs the Delaunay triangulation, a minimum spanning arborescence algorithm, and a triangulation of the arborescence to develop solutions to the DSMT problem. Example applications are also included.},
@article{
        author={Smith,J. M. and Toppur,Badri},
        year={1996},
        month={12/5},
        title={Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E3},
        journal={Discrete Applied Mathematics},
        volume={71},
        number={1-3},
        pages={187-215},
        abstract={We have found that a triple helix configuration of points in E3 yields the best value of the Steiner ratio for the Euclidean Steiner Minimal Tree (ESMT) problem. In this paper we explore the properties, configurations, and implications of this topology which yields this best Steiner ratio and its relationship to the Euclidean Graph embedding problem (EGEP) for weighted graphs in E3. The unique equivalence between these problems is also explored in their application for identification and modelling of minimum energy configurations (MECs) such as the biochemical protein structures of Collagen.},
@article{
        author={Smith,James M. and Gross,Meir},
        year={1982},
        title={Steiner minimal trees and urban service networks},
        journal={Socio-economic planning sciences},
        volume={16},
        number={1},
        pages={21-38},
        abstract={The optimal configuration of urban service networks has recently been shown to be a computationally difficult problem. However, there are efficient and effective techniques by which this optimal configuration of urban service networks can be approximated. In this paper, we analyze the Lp Steiner Network problem in the plane R2 and demonstrate its applicability to the urban service network problem. We present a simple algorithm for estimating the Lp metric parameter for random points in the plane, then utilize it to find the Lp values for four different American cities. Finally, we apply the LpSMT algorithm described within the text to one of the cities in order to demonstrate the effectiveness of our algorithm for determining optimal network configurations.},
@article{
        author={Smith,Warren D. and Smith,J. M.},
        year={1995},
        month={2},
        title={On the Steiner ratio in 3-space},
        journal={Journal of Combinatorial Theory, Series A},
        volume={69},
        number={2},
        pages={301-332},
        abstract={The "Steiner minimal tree" (SMT) of a point set P is the shortest network of "wires" which will suffice to electrically interconnnect P. The "minimum spanning tree" (MST) is the shortest such network when only intersite line segments are permitted. The "Steiner ratio" [rho](P) of a point set P is the length of its SMT divided by the length of its MST. It is of interest to understand which point set (or point sets) in Rd has minimal Steiner ratio. In this paper, we introduce a point set in Rd which we call the "d-dimensional sausage." The one- and two-dimensional sausages have minimal Steiner ratios 1 and [radical sign]3/2, respectively. (The 2-sausage is the vertex set of an infinite strip of abutting equilateral triangles. The 3-sausage is an infinite number of points evenly spaced along a helix.) We present extensive heuristic evidence to support the conjecture that the 3-sausage also has minimal Steiner ratio ([approximate] 0.784190373377122). Also, we prove that the regular tetrahedron minimizes [rho] among 4-point sets to at least 12 decimal places of accuracy. This is a companion paper to D-Z. Du and W. D. Smith, "Three Disproofs of the Gilbert-Pollak Steiner Ratio Conjecture in Three or More Dimensions," to be published in the Journal of Combinatorial Theory. We have tried to devote this paper more to 3D and the other paper more to general dimensions, but the split is not clean.},
@article{
        author={Talebi,Kayhan and Smith,James M.},
        year={1985},
        title={Stochastic network evacuation models},
        journal={Computers & Operations Research},
        volume={12},
        number={6},
        pages={559-577},
        abstract={Stochastic network evacuation models are crucial for the safe evacuation of occupants from buildings. In this paper, we compare an analytical closed queueing network and a simulation model for analyzing the evacuation of occupants from a hospital. Evacuation times, arc congestion, and optimization of the evacuation routes and staff assigned to the evacuation network are included.},
@article{
        author={Toppur,Badri and Smith,J. M. E. -.},
        year={2005},
        month={06//},
        title={A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space},
        journal={Journal of Mathematical Modelling and Algorithms},
        volume={4},
        number={2},
        pages={199-217},
@article{
        author={Toppur,Badri and Smith,J. M. E. -.},
        year={2004},
        month={03//},
        title={Properties of R-Sausages},
        journal={Discrete and Computational Geometry},
        volume={31},
        number={4},
        pages={587-611},
@article{
        author={Weng,J. F. and MacGregor Smith,J.},
        year={2001},
        title={Steiner Minimal Trees with One Polygonal Obstacle},
        journal={Algorithmica (New York)},
        volume={29},
        number={4},
        pages={638-648},
        note={Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.},
        abstract={In this paper we study the Steiner minimal tree T problem for a point set Z with cardinality n and one polygonal obstacle ω in the Euclidean plane, We assume ω touches only one convex path in T that joins two terminals and that the number of extreme points of the obstacle is k. If all degree 2 vertices are omitted, then the topology of T is called the primitive topology of T. Given a full primitive topology along with ω convex, we prove that T can be determined in O (n2 + n log2 k) time. Further, if ω is nonconvex, we then show that O(n2 + nk log k) time is required.},
        keywords={Problem solving; Topology; Computational complexity; Algorithms; Trees (mathematics)},
        isbn={0178-4617},
        url={http://dx.doi.org/10.1007/s00453-001-0002-1},
@article{
        author={Winter,Pawel and MacGregor Smith,J. E. -.},
        year={1992},
        month={12//},
        title={Path-distance heuristics for the Steiner problem in undirected networks},
        journal={Algorithmica},
        volume={7},
        number={1},
        pages={309-327},
@article{
        author={Winter,Pawel and MacGregor Smith,J. E. -.},
        year={1991},
        month={07//},
        title={Steiner minimal trees for three points with one convex polygonal obstacle},
        journal={Annals of Operations Research},
        volume={33},
        number={7},
        pages={577-599},
@article{
        author={Yuhaski,Steven J. and Smith,J. M. E. -.},
        year={1989},
        month={12//},
        title={Modeling circulation systems in buildings using state dependent queueing models},
        journal={Queueing Systems},
        volume={4},
        number={4},
        pages={319-338},
@article{
        author={Yuzukirmizi,Mustafa and Smith,J. M.},
        title={A customer threshold property for closed finite queueing networks},
        journal={Performance Evaluation},
        volume={In Press, Corrected Proof},
        abstract={We present a new class of finite queues in cyclic networks with production blocking. We show that with a threshold property related to the number of customers in the network, these queues are insensitive to the allocation of buffers and the order of the stations. In addition, some simple and practical, yet effective approximations are presented. Numerical examples have been carried out to demonstrate the efficacy of the approaches.},