Refworks Export Tagged Format

Character Set=utf-8

Tag legend
*****
RT=Reference Type
SR=Source Type
ID=Reference Identifier
A1=Primary Authors
T1=Primary Title
JF=Periodical Full
JO=Periodical Abbrev
YR=Publication Year
FD=Publication Data,Free Form
VO=Volume
IS=Issue
SP=Start Page
OP=Other Pages
K1=Keyword
AB=Abstract
NO=Notes
A2=Secondary Authors
T2=Secondary Title
ED=Edition
PB=Publisher
PP=Place of Publication
A3=Tertiary Authors
A4=Quaternary Authors
A5=Quinary Authors
T3=Tertiary Title
SN=ISSN/ISBN
AV=Availability
AD=Author Address
AN=Accession Number
LA=Language
CL=Classification
SF=Subfile/Database
OT=Original Foreign Title
LK=Links
DO=Document Object Index
CN=Call Number
DB=Database
DS=Data Source
IP=Identifying Phrase
RD=Retrieved Date
ST=Shortened Title
U1=User 1
U2=User 2
U3=User 3
U4=User 4
U5=User 5
UL=URL
SL=Sponsoring Library
LL=Sponsoring Library Location
CR=Cited References
WT=Website Title
A6=Website Editor
WV=Website Version
WP=Date of Electronic Publication

*****
Font Attribute Legend
Start Bold = 
End Bold = 
Start Underline = 
End Underline = 
Start Italic = 
End Italic = 
Start SuperScript = 
End SuperScript = 
Start SubScript = 
End SubScript = 

*****
BEGIN EXPORTED REFERENCES




RT Journal
SR Print
ID 335
A1 Bakuli,David L.
A1 MacGregor Smith,J.
T1 Resource allocation in state-dependent emergency evacuation networks
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 1996
VO 89
IS 3
SP 543
OP 555
K1 Resource allocation
K1 Mathematical models
K1 Algorithms
K1 Optimization
K1 Planning
K1 Queueing theory
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
PB Elsevier Science B.V., Amsterdam, Netherlands
SN 0377-2217
AD Univ of Massachusetts, Amherst, MA, USA
LK http://dx.doi.org/10.1016/0377-2217(94)00230-4
U1 96053161387
U2 State dependent emergency evacuation networks; Emergency planning; Routing

RT Journal
SR Print
ID 348
A1 Cruz,F.
A1 Colosimo,E. A.
A1 MacGregor Smith,J.
T1 Sample Size Corrections for the Maximum Partial Likelihood Estimator
JF Communications in Statistics: Simulation and Computation
YR 2004
VO 33
IS 1
SP 35
OP 47
AB 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.
LK http://www.journalsonline.tandf.co.uk/openurl.asp?genre=article&id=doi:10.1081/SAC-120028432
DO 10.1081/SAC-120028432
IP Maximum partial likelihood estimate, Censored data, Bootstrap, Jackknife

RT Journal
SR Print
ID 296
A1 Cruz,F. R. B.
A1 MacGregor Smith,J.
T1 Approximate analysis of M/G/c/c state-dependent queueing networks
JF Computers & Operations Research
JO Comput.Oper.Res.
VO In Press, Corrected Proof
AB 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.
UL http://www.sciencedirect.com/science/article/B6VC5-4H98T9G-4/2/3c5891a25a770d17aba0c7f2bf42d7a7

RT Journal
SR Print
ID 330
A1 Cruz,F. R. B.
A1 MacGregor Smith,J.
A1 Medeiros,R. O.
T1 An M/G/C/C state-dependent network simulation model
JF Computers and Operations Research
YR 2005
VO 32
IS 4
SP 919
OP 941
K1 Customer satisfaction
K1 Telecommunication traffic
K1 Topology
K1 Markov processes
K1 Probability
K1 Computer simulation
K1 Queueing networks
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
PB Elsevier Ltd, Oxford, OX5 1GB, United Kingdom
SN 0305-0548
AD Department of Mechanical Engineering, University of Massachusetts, Amherst, MA 01003, United States
LK http://dx.doi.org/10.1016/j.cor.2003.09.006
U1 04448434859
U2 Discrete-event simulation; Finite capacity; State dependent; Accumulation conveyor systems

RT Journal
SR Print
ID 298
A1 Cruz,F. R. B.
A1 MacGregor Smith,J.
A1 Queiroz,D. C.
T1 Service and capacity allocation in M/G/c/c state-dependent queueing networks
JF Computers & Operations Research
JO Comput.Oper.Res.
YR 2005
FD 6
VO 32
IS 6
SP 1545
OP 1563
AB 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.
UL http://www.sciencedirect.com/science/article/B6VC5-4BG3H1R-2/2/bec7c7fce4b01b786fa59a18bc8bdd4c

RT Journal
SR Print
ID 282
A1 Cruz,F. R. B.
A1 Mateus,G. R.
A1 MacGregor Smith,J. ER -.
T1 A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem
JF Journal of Mathematical Modelling and Algorithms
YR 2003
FD 03//
VO 2
IS 1
SP 37
OP 56
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1023670814370

RT Journal
SR Print
ID 307
A1 Cruz,F. R. B.
A1 Smith,J. MacGregor
A1 Mateus,G. R.
T1 Algorithms for a multi-level network optimization problem
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 1999
FD 10/1
VO 118
IS 1
SP 164
OP 180
AB 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.
UL http://www.sciencedirect.com/science/article/B6VCT-3WT2P48-C/2/27a265a410398fd8f7c4e65f23be6603

RT Journal
SR Print
ID 308
A1 Cruz,F. R. B.
A1 Smith,J. MacGregor
A1 Mateus,G. R.
T1 Solving to optimality the uncapacitated fixed-charge network flow problem
JF Computers & Operations Research
JO Comput.Oper.Res.
YR 1998
FD 1
VO 25
IS 1
SP 67
OP 81
AB 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.
UL http://www.sciencedirect.com/science/article/B6VC5-46Y4VWH-8/2/e38bad304e52a1baa29dc74a04671788

RT Journal
SR Print
ID 329
A1 D. Spinellis, C. Papadopoulos, J. MaCgregor Smith
T1 Large production line optimization using simulated annealing
JF International Journal of Production Research
YR 2000
VO 38
IS 3
SP 509
OP 541
AB 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.
PB Taylor & Francis
LK http://taylorandfrancis.metapress.com/openurl.asp?genre=article&id=doi:10.1080/002075400189284
DO 10.1080/002075400189284

RT Journal
SR Print
ID 284
A1 Daskalaki,Sophia
A1 MacGregor Smith,J. ER -.
T1 Combining Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks
JF Annals of Operations Research
YR 2004
FD 01//
VO 125
IS 1 - 4
SP 47
OP 68
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/B:ANOR.0000011185.77227.ae

RT Journal
SR Print
ID 275
A1 Dolan,John
A1 Weiss,Richard
A1 MacGregor Smith,J. ER -.
T1 Minimal length tree networks on the unit sphere
JF Annals of Operations Research
YR 1991
FD 07//
VO 33
IS 7
SP 501
OP 535
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF02067239

RT Journal
SR Print
ID 300
A1 Erkip,Nesim
T1 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
JF Operations Research Letters
JO Oper.Res.Lett.
YR 2005
FD 3
VO 33
IS 2
SP 219
OP 220
UL http://www.sciencedirect.com/science/article/B6V8M-4D5P70K-1/2/055b75dc28d3d6c1a7d00520dbb95efb

RT Journal
SR Print
ID 346
A1 Gosavi,H. D.
A1 MacGregor Smith,J.
T1 An algorithm for sub-optimal routing in series-parallel queueing networks
JF International Journal of Production Research
YR 1997
VO 35
IS 5
SP 1413
OP 1430
AB 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.
PB Taylor & Francis
LK http://www.journalsonline.tandf.co.uk/openurl.asp?genre=article&id=doi:10.1080/002075497195399
DO 0.1080/002075497195399

RT Journal
SR Print
ID 312
A1 Gosavi,Hemant D.
A1 Smith,J. MacGregor
T1 Asymptotic bounds of throughput in series-parallel queueing networks
JF Computers & Operations Research
JO Comput.Oper.Res.
YR 1995
FD 12
VO 22
IS 10
SP 1057
OP 1073
AB 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.
UL http://www.sciencedirect.com/science/article/B6VC5-3YCMM9F-8/2/0176c6fe6e4324d9b6f0ca33997d6b4c

RT Conference Proceedings
SR Print
ID 339
A1 Han,Y.
A1 MacGregor Smith,J.
T1 Approximate analysis of open M/M/C/K queueing networks
YR 1993
SP 113
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
T2 Proceedings of the 2nd International Conference on Queueing Networks with Finite Capacity, Sep 28-30 1992
PB Publ by Elsevier Science Publishers B.V., Amsterdam, Neth
PP Research Triangle Park, NC, USA
T3 Proceedings of the International Conference on Queueing Networks with Finite Capacity
SN 0-444-89772-0
AD Univ of Massachusetts-Amherst, MA, USA
U1 93101709743

RT Book, Section
SR Print
ID 345
A1 J. MacGregor Smith
T1 Evacuation networks
YR 2001
VO 29
SP 36
OP 44
A2 Floudas C. A.
A2 Pardalos,P. M.
T2 Encyclopedia of Optimization
PB Kluwer Academic Publishers

RT Journal
SR Print
ID 317
A1 Jain,Sushant
A1 Smith,J. MacGregor
T1 Open finite queueing networks with M/M/C/K parallel servers
JF Computers & Operations Research
JO Comput.Oper.Res.
YR 1994
FD 3
VO 21
IS 3
SP 297
OP 317
AB 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.
UL http://www.sciencedirect.com/science/article/B6VC5-48MYFVF-72/2/753372ac2874e54c93d6082ca35f2de4

RT Journal
SR Print
ID 321
A1 Kerbache,Laoucine
A1 MacGregor Smith,J.
T1 Asymptotic behavior of the expansion method for open finite queueing networks
JF Computers & Operations Research
JO Comput.Oper.Res.
YR 1988
VO 15
IS 2
SP 157
OP 169
AB 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.
UL http://www.sciencedirect.com/science/article/B6VC5-48M308R-8T/2/74455b6ee679bd9eea94ac6b1a1efee4

RT Journal
SR Print
ID 301
A1 Kerbache,Laoucine
A1 MacGregor Smith,James
T1 Queueing networks and the topological design of supply chain systems
JF International Journal of Production Economics
JO Int J Prod Econ
YR 2004
FD 10/18
VO 91
IS 3
SP 251
OP 272
AB 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.
UL http://www.sciencedirect.com/science/article/B6VF8-4B5BFF1-3/2/78f2e8329c25040f46b10dec9ff46cc6

RT Journal
SR Print
ID 306
A1 Kerbache,Laoucine
A1 Smith,J. MacGregor
T1 Multi-objective routing within large scale facilities using open finite queueing networks
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 2000
FD 2/15
VO 121
IS 1
SP 105
OP 123
AB 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.
UL http://www.sciencedirect.com/science/article/B6VCT-3Y9MCF4-9/2/66588f10003630c46718010cf5b3cb91

RT Journal
SR Print
ID 322
A1 Kerbachea,Laoucine
A1 MacGregor Smith,J.
T1 The generalized expansion method for open finite queueing networks
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 1987
FD 12
VO 32
IS 3
SP 448
OP 461
AB 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.
UL http://www.sciencedirect.com/science/article/B6VCT-4GK296W-D/2/4cfd610c3711060615821d6c537d1736

RT Journal
SR Print
ID 318
A1 Kolli,Sai S.
T1 Topological network design : J. MacGregor Smith and P. Winter J.C. Baltzer AG, Basel, 1991, xxii + 612 pages
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 1993
FD 11/26
VO 71
IS 1
SP 143
OP 144
UL http://www.sciencedirect.com/science/article/B6VCT-48M3G1R-73/2/9805069901551034558db67cc41fcb94

RT Journal
SR Print
ID 332
A1 Kubat,P.
A1 MacGregor Smith,J.
T1 A multi-period network design problem for cellular telecommunication systems
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 2001
VO 134
IS 2
SP 439
OP 456
K1 Cellular radio systems
K1 Telecommunication networks
K1 Lagrange multipliers
K1 Linear programming
K1 Heuristic methods
K1 Polynomials
K1 Computational methods
K1 Random number generation
K1 Algorithms
K1 Relaxation processes
K1 Operations research
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
PB Elsevier Science B.V
SN 0377-2217
AD Department of Mechanical Engineering, University of Massachusetts, Marston Hall, Amherst, MA 01003, United States
LK http://dx.doi.org/10.1016/S0377-2217(00)00271-X
U1 01386649761
U2 Branch-and-bound algorithms; Steiner-like networks

RT Journal
SR Print
ID 337
A1 Li,Wu-Ji
A1 MacGregor Smith,J.
T1 Algorithm for Quadratic Assignment Problems
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 1995
VO 81
IS 1
SP 205
OP 216
K1 Site selection
K1 Location
K1 Random processes
K1 Sampling
K1 Heuristic programming
K1 Algorithms
K1 Large scale systems
K1 Mathematical models
K1 Plant layout
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
PB Elsevier Science B.V., Amsterdam, Netherlands
SN 0377-2217
AD AT&T, Morristown, NJ, USA
LK http://dx.doi.org/10.1016/0377-2217(93)E0162-Q
U1 95032621146
U2 Stochastic traffic congestion; Facility layout problem; Quadratic Assignment Problem

RT Journal
SR Print
ID 280
A1 Liberopoulos,G.
A1 Papadopoulos,C. T.
A1 Tan,B.
A1 Smith,J. MacGregor
A1 Gershwin,S. B. ER -.
T1 Stochastic models for the design, coordination, and control of manufacturing systems
JF OR Spectrum
YR 2005
FD 06//
VO 27
IS 2 - 3
SP 167
OP 169
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00291-005-0205-y

RT Journal
SR Print
ID 302
A1 MacGregor Smith,J.
T1 Optimal design and performance modelling of M/G/1/K queueing systems
JF Mathematical and Computer Modelling
JO Math.Comput.Model.
YR 2004
FD 5
VO 39
IS 9-10
SP 1049
OP 1081
AB 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.
UL http://www.sciencedirect.com/science/article/B6V0V-4CYNK2D-14/2/bde904e98b495e913a9ce13acf266e49

RT Journal
SR Print
ID 338
A1 MacGregor Smith,J.
T1 Cellular arrangement problems with random flows
JF Engineering Optimization
YR 1995
VO 24
IS 1
SP 59
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
PB Gordon & Breach Science Publ Inc, Newark, NJ, USA
SN 0305-215X
U1 95062729466

RT Journal
SR Print
ID 319
A1 MacGregor Smith,J.
T1 State-dependent queueing models in emergency evacuation networks
JF Transportation Research Part B: Methodological
YR 1991
FD 12
VO 25
IS 6
SP 373
OP 389
AB 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.
UL http://www.sciencedirect.com/science/article/B6V99-46MMY9H-F/2/08d1623e5e6a3f27b83f781db44ac97f

RT Journal
SR Print
ID 344
A1 MacGregor Smith,J.
T1 USE OF QUEUING NETWORKS AND MIXED INTEGER PROGRAMMING TO ALLOCATE RESOURCES OPTIMALLY WITHIN A LIBRARY LAYOUT
YR 1981
VO 32
IS 1
SP 33
OP 42
K1 OPERATIONS RESEARCH - Applications
K1 MATHEMATICAL PROGRAMMING - Applications
K1 INFORMATION SERVICES
K1 PROBABILITY - Queueing Theory
K1 LIBRARIES
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
T3 Journal of the American Society for Information Science
SN 0002-8231
AD Univ of Mass, Amherst
U1 81110004723
U2 ECONOMIC RESOURCE ALLOCATION; MIXED INTEGER PROGRAMMING

RT Journal
SR Print
ID 333
A1 MacGregor Smith,J.
A1 Li,Wu-Ji
T1 Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows
JF Journal of Combinatorial Optimization
YR 2001
VO 5
IS 4
SP 421
OP 443
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
PB Kluwer Academic Publishers
SN 1382-6905
AD Dept. of Mech. and Indust. Eng., University of Massachusetts, Amherst, MA 01003, United States
LK http://dx.doi.org/10.1023/A:1011624708694
U1 04057983915

RT Journal
SR Print
ID 342
A1 MacGregor Smith,J.
A1 Liebman,Judith S.
T1 STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN
YR 1979
VO 4
IS 1
SP 15
OP 36
K1 OPTIMIZATION
K1 BUILDING
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
T3 Engineering Optimization
SN 0305-215X
U1 79050008056

RT Journal
SR Print
ID 279
A1 MacGregor Smith,J. ER -.
T1 Dilemmas in factory design: paradox and paradigm
JF OR Spectrum
YR 2005
FD 06//
VO 27
IS 2 - 3
SP 171
OP 193
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00291-005-0199-5

RT Journal
SR Print
ID 283
A1 Mazzini,Filipe F.
A1 Mateus,Geraldo R.
A1 Smith,James MacGregor ER -
T1 Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems
JF Wireless Networks
YR 2003
FD 11//
VO 9
IS 6
SP 659
OP 672
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1023/A:1025964603779

RT Journal
SR Print
ID 313
A1 Melachrinoudis,Emanuel
A1 Smith,J. MacGregor
T1 An O(mn2) algorithm for the Maximin problem in E2
JF Operations Research Letters
JO Oper.Res.Lett.
YR 1995
FD 8
VO 18
IS 1
SP 25
OP 30
AB An O(mn2) algorithm is developed in this paper for the Euclidean weighted Maximin problem using the weighted Voronoi diagram in the plane.
UL http://www.sciencedirect.com/science/article/B6V8M-3Y6PG8R-N/2/9b4b9ba556cde58dc7ce10eb942f9a34

RT Journal
SR Print
ID 305
A1 Mitchell,David H.
A1 MacGregor Smith,J.
T1 Topological network design of pedestrian networks
JF Transportation Research Part B: Methodological
YR 2001
FD 2
VO 35
IS 2
SP 107
OP 135
AB 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.
UL http://www.sciencedirect.com/science/article/B6V99-41NK890-1/2/01ecab0e72fd572153bd38f5b7614c1b

RT Journal
SR Print
ID 320
A1 Norbis,Mario I.
A1 MacGregor Smith,J.
T1 A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 1988
FD 1
VO 33
IS 1
SP 30
OP 41
AB 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.
UL http://www.sciencedirect.com/science/article/B6VCT-48VW71W-29/2/4b101fbb2b2c155db9e2365927ca3d03

RT Journal
SR Print
ID 334
A1 Norbis,Mario
A1 MacGregor Smith,J.
T1 Interactive decision support system for the resource constrained scheduling problem
JF European Journal of Operational Research
JO Eur.J.Oper.Res.
YR 1996
VO 94
IS 1
SP 54
OP 65
K1 Decision support systems
K1 Resource allocation
K1 Scheduling
K1 Constraint theory
K1 Optimization
K1 Performance
K1 Heuristic methods
K1 Interactive computer systems
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
SN 0377-2217
AD Quinnipiac Coll, Hamden, CT, USA
LK http://dx.doi.org/10.1016/0377-2217(95)00187-5
U1 96100379638
U2 Resource constrained scheduling problem; Dynamic heuristics; Decision maker; Priority rules

RT Journal
SR Print
ID 303
A1 Smith,J. MacGregor
T1 M/G/c/K blocking probability models and system performance
JF Performance Evaluation
YR 2003
FD 5
VO 52
IS 4
SP 237
OP 267
AB 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.
UL http://www.sciencedirect.com/science/article/B6V13-47MSP9N-1/2/bbbc6a284deba7e7eb540c8392238e11

RT Journal
SR Print
ID 258
A1 Smith,J. MacGregor
T1 Application of State-Dependent Queues to Pedestrian/Vehicular Network Design
JF Operations research
JO Oper.Res.
YR 1994
FD May - Jun.
VO 42
IS 3
SP 414
OP 427
K1 Facilities/equipment planning: layout
K1 routing and resource allocation
K1 Queues
K1 networks: state-dependent queues
K1 OR Practice
AB 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.
NO ID: 24; GR: OR Practice
PB Operations Research Society of America
SN 0030364x
SF FLA; Copyright 1994 INFORMS
LK http://links.jstor.org/sici?sici=0030-364X%28199405%2F06%2942%3A3%3C414%3AAOSQTP%3E2.0.CO%3B2-V

RT Journal
SR Print
ID 326
A1 Smith,J. MacGregor
T1 Queuing networks and facility planning
JF Building and Environment
JO Build.Environ.
YR 1982
VO 17
IS 1
SP 33
OP 45
AB 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.
UL http://www.sciencedirect.com/science/article/B6V23-47WVNFX-M/2/1cfa37d024dccb8d4a199259b86d322f

RT Journal
SR Print
ID 323
A1 Smith,J. Macgregor
A1 Bouanaka,Bouteldja
T1 Queuing network decomposition and facilities planning
JF Computers & Operations Research
JO Comput.Oper.Res.
YR 1985
VO 12
IS 1
SP 1
OP 16
AB 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.
UL http://www.sciencedirect.com/science/article/B6VC5-48M2Y82-1B/2/e2ce1af5e03450bb8033474e22ad1816

RT Journal
SR Print
ID 276
A1 Smith,J. MacGregor
A1 Chikhale,Nikhil ER -.
T1 Buffer allocation for a class of nonlinear stochastic knapsack problems
JF Annals of Operations Research
YR 1995
FD 09//
VO 58
IS 5
SP 323
OP 360
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF02038860

RT Journal
SR Print
ID 327
A1 Smith,J. MacGregor
A1 Liebman,Judith S.
T1 An O (n2) heuristic algorithm for the directed Steiner minimal tree problem
JF Applied Mathematical Modelling
JO Appl.Math.Model.
YR 1980
FD 10
VO 4
IS 5
SP 369
OP 375
AB 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.
UL http://www.sciencedirect.com/science/article/B6TYC-45D9WYG-8K/2/870ededac0ba9da6282ff96461f85311

RT Journal
SR Print
ID 309
A1 Smith,J. MacGregor
A1 Toppur,Badri
T1 Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E3
JF Discrete Applied Mathematics
YR 1996
FD 12/5
VO 71
IS 1-3
SP 187
OP 215
AB 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.
UL http://www.sciencedirect.com/science/article/B6TYW-3VTK33B-C/2/e8adfb17ff82b39834c52a0843a84036

RT Journal
SR Print
ID 325
A1 Smith,James Macgregor
A1 Gross,Meir
T1 Steiner minimal trees and urban service networks
JF Socio-economic planning sciences
JO Socioecon.Plann.Sci.
YR 1982
VO 16
IS 1
SP 21
OP 38
AB 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.
UL http://www.sciencedirect.com/science/article/B6V6Y-45DHT78-73/2/5440e8abe9df74908c8e3129e370f5e5

RT Journal
SR Print
ID 315
A1 Smith,Warren D.
A1 Smith,J. MacGregor
T1 On the Steiner ratio in 3-space
JF Journal of Combinatorial Theory, Series A
YR 1995
FD 2
VO 69
IS 2
SP 301
OP 332
AB 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.
UL http://www.sciencedirect.com/science/article/B6WHS-4D0YB4K-6/2/87bfd24b4565c90bebbd355427b20a23

RT Journal
SR Print
ID 324
A1 Talebi,Kayhan
A1 Smith,James Macgregor
T1 Stochastic network evacuation models
JF Computers & Operations Research
JO Comput.Oper.Res.
YR 1985
VO 12
IS 6
SP 559
OP 577
AB 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.
UL http://www.sciencedirect.com/science/article/B6VC5-48M2YDS-2W/2/8deb68ca6adb097022f9d9242c48a3d2

RT Journal
SR Print
ID 278
A1 Toppur,Badri
A1 Smith,J. MacGregor ER -.
T1 A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space
JF Journal of Mathematical Modelling and Algorithms
YR 2005
FD 06//
VO 4
IS 2
SP 199
OP 217
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s10852-004-6390-x

RT Journal
SR Print
ID 285
A1 Toppur,Badri
A1 Smith,J. MacGregor ER -.
T1 Properties of R-Sausages
JF Discrete and Computational Geometry
YR 2004
FD 03//
VO 31
IS 4
SP 587
OP 611
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00454-004-2851-2

RT Journal
SR Print
ID 331
A1 Weng,J. F.
A1 MacGregor Smith,J.
T1 Steiner Minimal Trees with One Polygonal Obstacle
JF Algorithmica (New York)
YR 2001
VO 29
IS 4
SP 638
OP 648
K1 Problem solving
K1 Topology
K1 Computational complexity
K1 Algorithms
K1 Trees (mathematics)
AB 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.
NO Compilation and indexing terms, Copyright 2005 Elsevier Engineering Information, Inc.
PB Springer-Verlag New York Inc
SN 0178-4617
AD Department of Mathematics, University of Melbourne, Melbourne, Vic. 3052, Australia
LK http://dx.doi.org/10.1007/s00453-001-0002-1
U1 03467728318
U2 Polygonal

RT Journal
SR Print
ID 277
A1 Winter,Pawel
A1 MacGregor Smith,J. ER -.
T1 Path-distance heuristics for the Steiner problem in undirected networks
JF Algorithmica
YR 1992
FD 12//
VO 7
IS 1
SP 309
OP 327
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01758765

RT Journal
SR Print
ID 274
A1 Winter,Pawel
A1 MacGregor Smith,J. ER -.
T1 Steiner minimal trees for three points with one convex polygonal obstacle
JF Annals of Operations Research
YR 1991
FD 07//
VO 33
IS 7
SP 577
OP 599
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF02067243

RT Journal
SR Print
ID 328
A1 Yuhaski,Steven J.
A1 Smith,J. Macgregor ER -.
T1 Modeling circulation systems in buildings using state dependent queueing models
JF Queueing Systems
YR 1989
FD 12//
VO 4
IS 4
SP 319
OP 338
UL http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/BF01159471

RT Journal
SR Print
ID 297
A1 Yuzukirmizi,Mustafa
A1 Smith,J. MacGregor
T1 A customer threshold property for closed finite queueing networks
JF Performance Evaluation
VO In Press, Corrected Proof
AB 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.
UL http://www.sciencedirect.com/science/article/B6V13-4GK1GB0-1/2/df3bf9269c1e8af8f46efc01d5399057