Poisson Process Queue Length Critical Path Arrival Process Sojourn Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Barahona F., A. Weintraub and R. Epstein (1992). “Habitat Dispersion in Forest Planning and the Stable Set Problem,” Operations Research, 40 (1), S14–S21.Google Scholar
  2. [2]
    Bare B.B., D.G. Briggs, J.P. Roise and G.F. Schreuder (1984). “A Survey of Systems Analysis Models in Forestry and the Forest Products Industries,” European Jl. Operational Research, 18, 1–18.Google Scholar
  3. [3]
    Bare B.B. and G.A. Mendoza (1988). “Multiple Objective Forest Land Management Planning: An Illustration,” European Jl. Operational Research, 34, 44–55.Google Scholar
  4. [4]
    Bare B.B. and G.A. Mendoza (1994). “A Fuzzy Approach to Natural Resource Management from a Regional Perspective,” International Transactions in Operational Research, 1, 51–58.Google Scholar
  5. [5]
    Dykstra D. (1984). Mathematical Programming for Natural Resource Management, McGraw-Hill, New York.Google Scholar
  6. [6]
    Elbrond J. (1988). “Evolution of Operations Research Techniques in the Mining Industry” in Computer Applications in the Mineral Industry ( K. Fytas, J.L. Collins, and R. Singhal, eds.). A.A. Balkema, Rotterdam.Google Scholar
  7. [7]
    Garcia O. (1990). “Linear Programming and Related Approaches in Forest Planning,” New Zealand Jl Forest Science, 20, 307–331.Google Scholar
  8. [8]
    Guimaraes, Rodrigues A., ed. (1990). Operations Research and Management in Fishing, Kluwer Academic Publishers, Dordrecht, The Netherlands.Google Scholar
  9. [9]
    Glen J.J. (1987). “Mathematical Models in Farm Planning: A Survey,” Operations Research, 35, 641–666.Google Scholar
  10. [10]
    Golden B. and E. Wasil (1993). “Managing Fish, Forests, Wildlife and Water Successful Applications of Management Science and Operations Research Models to Natural Resource Decision Problems,” in Operations Research and Public Systems (S. Pollock, A. Barnett and M. Rothkopf, eds.). Handbook in Operations Research and Management Science, 7.Google Scholar
  11. [11]
    Hof J.G., B.M. Kent and J.B. Pickens (1992). “Chance Constraints and Chance Maximization with Random Yield Coefficients in Renewable Resource Optimization,” Forest Science, 38, 305– 323.Google Scholar
  12. [12]
    Hazell P.B.R. and R.D. Norton (1986). Mathematical Programming for Economic Analysis in Agriculture, Macmillan, New York.Google Scholar
  13. [13]
    Kallio M., A.E. Andersson, R. Seppala and A. Morgan, eds. (1986), “Systems Analysis in Forestry and Forest Industries,” TIMS Studies in the Management Sciences, 21.Google Scholar
  14. [14]
    Kennedy J.O.S. (1986). Dynamic Programming: Applications to Agriculture and Natural Resources, Elsevier Applied Science Publishers, London, England.Google Scholar
  15. [15]
    Kent B., B.B. Bare, R.C. Field and G.A. Bradley (1991). “Natural Resource Land Management Planning Using Large-Scale Linear Programs: The USDA Forest Service Experience with FOR- PLAN,” Operations Research, 39, 13–27.Google Scholar
  16. [16]
    Kirby M.W., W.A. Hager and P. Wong (1986). “Simultaneous Planning of Wildland Management and Transportation Alternatives,” TIMS Studies in the Management Sciences, 21, 371–387.Google Scholar
  17. [17]
    Kutcher G.P. and R.D. Norton (1982). “Operations Research Methods in Agricultural Policy Analysis,” European JL Operational Research, 10, 333–345.Google Scholar
  18. [18]
    Lane D.E. (1989). “Operational Research and Fisheries Management,” European JL Operational Research, 42, 229–242.Google Scholar
  19. [19]
    Lane K.F. (1988). The Economic Definition of Ore, Mining Journal Books Ltd.Google Scholar
  20. [20]
    Lockwood C. and T. Moore (1993). “Harvest Scheduling with Spatial Constraints: A Simulated Annealing Approach,” Canadian JL Forest Research, 23, 468–478.Google Scholar
  21. [21]
    Martell D., Davis L. and A. Weintraub, eds. (1993). Proceedings of the Workshop on Hierarchical Approaches to Forest Management in Public and Private Organizations. University of Toronto.Google Scholar
  22. [22]
    Martell D.L. (1982). “A Review of Operational Research Studies in Forest Fire Management,” Canadian Jl. Forest Research, 12, 119–140.Google Scholar
  23. [23]
    Nelson J. and D. Brodie (1990). “Comparison of a Random Search Algorithm and Mixed Integer Programming for Solving Area-Based Forest Plans,” Canadian Jl Forest Research, 20, 934– 942.Google Scholar
  24. [24]
    Romero C. and T. Rehman (1989). Multiple Criteria Analysis for Agricultural Decisions. Elsevier, Amsterdam.Google Scholar
  25. [25]
    Sessions J. and J.B. Sessions (1991). “Tactical Harvest Planning,” in Proceedings of 1991 Society of American Foresters National Convention, SAF Publication 91-05, 362–368, Bethesda, Maryland.Google Scholar
  26. [26]
    Simon H. (1982). Models of Bounded Rationality. Economic Analysis and Public Policy. The MIT Press, Cambridge, Massachusetts.Google Scholar
  27. [27]
    Starfield A.M. and A.L. Bleloch (1986). Building Models for Conservation and Wildlife Management, Macmillan, New York.Google Scholar
  28. [28]
    Yeh W.G. (1985). “Reservoir Management and Operations Models: A State of the Art Review,” Water Resources Research, 21 & 22, 1797–1818.Google Scholar
  29. Ahuja R.K., T.L. Magnanti and J.B. Orlin (1993), Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, New Jersey.Google Scholar
  30. [2]
    Ball M., T.L. Magnanti, C. Monma and G.L. Nemhauser (1995), Network Models, vol. 7, Handbooks of Operations Research and Management Science, Elsevier, New YorkGoogle Scholar
  31. [3]
    Ball M., T.L. Magnanti, C. Monma and G.L. Nemhauser (1995), Network Routing, vol. 8, Handbooks of Operations Research and Management Science, Elsevier, New York.Google Scholar
  32. [4]
    Ford L.R. and D.R. Fulkerson (1962), Flows in Networks, Princeton University Press, New Jersey.Google Scholar
  33. [5]
    Glover F., D. Klingman and N. Phillips (1992), Network Models in Optimization and Their Applications in Practice, John Wiley, New York.Google Scholar
  34. [6]
    Lawler E.L. (1976), Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Whinston, New York.Google Scholar
  35. [1]
    Boctor F.F. (1990). “Some efficient multi-heuristic procedures for resource-constrained project scheduling.” European Journal of Operational Research 49, 3–13.Google Scholar
  36. [2]
    Davies E.M. (1973). “An experimental investigation of resource allocation in multiactivity projects.” Operational Research Quarterly 24, 587–591.Google Scholar
  37. [3]
    de Wit J. and W. Herroelen (1990). “An evaluation of microcomputer-based software packages for project management.” European Jl. Operational Research 49, 102–139.Google Scholar
  38. [4]
    Elmaghraby S.E. (1977). Activity Networks: Project Planning and Control by Network Models. Wiley, New York.Google Scholar
  39. [5]
    Fondahl J.W. (1961). A noncomputer approach to the Critical Path Method for the construction industry. Dept. of Civil Engineering, Stanford University, Stanford, California.Google Scholar
  40. [6]
    Fulkerson D.R. (1961). “A network flow computation for project cost curves.” Management Science 7, 167–178.Google Scholar
  41. [7]
    Golenko-Ginzburg D. (1989). “PERT assumptions revisited.” Omega 17, 393–396.Google Scholar
  42. [8]
    Kelley J.E. (1961). “Critical-path planning and scheduling: mathematical basis.” Operations Research 9, 296–320.Google Scholar
  43. [9]
    Kelley J.E. and M.R. Walker, eds. (1959). “Critical-path planning and scheduling.” In Proceedings of Eastern Joint Computer Conference, Boston, December 1–3, 1959, 160–173.Google Scholar
  44. [10]
    Malcolm D.G., J.H. Roseboom, C.E. Clark and W. Fazar (1959). “Application of a technique for research and development program evaluation.” Operations Research 7, 646–669.Google Scholar
  45. [11]
    Moder J.J., C.R. Phillips and E.W. Davis (1983). Project Management with CPM, PERT and Precedence Diagramming, Van Nostrand, New York.Google Scholar
  46. [12]
    Patterson J.H. (1984). “A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem.” Management Science 30, 854–867.Google Scholar
  47. [13]
    Patterson J.H. and W.D. Huber (1974). “A horizon-varying, zero-one approach to project scheduling.” Management Science 20, 990–998.Google Scholar
  48. [14]
    Pritsker A.A.B., L.J. Walters and P.M. Wolfe (1969). “Multi-project scheduling with limited resources: a zero-one programming approach.” Management Science 16, 93–108.Google Scholar
  49. [15]
    Probst A.R. and J. Worlitzer (1988). “Troject management and expert systems.” International Jl. Project Management 6, 11–17.Google Scholar
  50. [16]
    Ritchie E. (1985). “Network based planning techniques: a critical review of published developments.” In Further Developments in Operational Research (G.K. Rand and R.W. Eglese, eds.), 34– 56. Pergamon, Oxford.Google Scholar
  51. [17]
    Roy B. (1964). “Contribution de la theorie des graphes a I’etude des problems d’ordonnancement.” In Les problems d’ordonnancement: applications et methodes ( B. Roy, ed.), 109–125. Paris, Dunod.Google Scholar
  52. [18]
    Sculli D. (1989). “A historical note on PERT times.” Omega 17, 195–196.Google Scholar
  53. [19]
    Slowinski R. and J. Weglarz (1989). Advances in Project Scheduling. Studies in Production and Engineering Economics. North Holland, Amsterdam.Google Scholar
  54. [20]
    Talbot F.B. and J.H. Patterson (1978). “An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems.” Management Science 24, 1163–1174.Google Scholar
  55. [21]
    Tavares L.V. (1987). “Optimal resource profiles for program scheduling.” European JL Operational Research 29, 83–90.Google Scholar
  56. [22]
    Tavares L.V. (1989). “A multi-stage model for project scheduling under resource constraints.” In Advances in Project Scheduling ( R. Slowinski and J. Weglarz, eds.), 315–326. Amsterdam, The Netherlands, Elsevier Science Publishers.Google Scholar
  57. [23]
    Wasil E.A. and A.A. Assad (1988). “Project management on the PC: software, applications, and trends.” Interfaces 18 (2), 75–84.Google Scholar
  58. [24]
    Weist J.D. (1967). “A heuristic model for scheduling large projects with limited resources.” Management Science 13, B369–B377.Google Scholar
  59. [1]
    Disney R.L. and Kiessler P.C. (1987), Traffic Processes in Queueing Networks: A Markov Renewal Approach, Johns Hopkins University Press, Baltimore.Google Scholar
  60. [2]
    Kelly F.P. (1979), Reversibility and Stochastic Networks, John Wiley, New York.Google Scholar
  61. [3]
    QUESTA (1993), Queueing Systems: Theory and Applications, 13, May.Google Scholar
  62. [4]
    Syski R. (1960), An Introduction to Congestion Theory in Telephone Systems, Oliver and Boyd, London.Google Scholar
  63. [5]
    Takagi H. (1991), Queueing Analysis: A Foundation for Performance Analysis, Vacation and Priority Systems, part 1, North-Holland, Amsterdam.Google Scholar
  64. [6]
    Takagi H. (1986), Analysis of Polling Systems, MIT Press, Cambridge, Massachusetts.Google Scholar
  65. [7]
    van Dijk N.M. (1993), Queueing Networks and Product Forms: A Systems Approach, John Wiley, New York.Google Scholar
  66. [8]
    Walrand J. (1988), An Introduction to Queueing Networks, Prentice-Hall, Englewood Cliffs, New Jersey.Google Scholar
  67. [9]
    Whittle P. (1986), Systems in Stochastic Equilibrium, John Wiley, New York.Google Scholar
  68. [1]
    Burke Laura I. and James P. Ignizio (1992). “Neural Networks and Operations Research: An Overview,” Computers and Operations Research, 19 (3/4), 179–189.Google Scholar
  69. [2]
    Burke Laura I. (1991). “Introduction to Artificial Neural Systems for Pattern Recognition,” Computers and Operations Research, 18 (2), 211–220.Google Scholar
  70. [3]
    Lippmann Richard P. (1987). “An Introduction to Computing with Neural Networks,” IEEE ASSP Magazine, April, 4–22.Google Scholar
  71. [4]
    McCulloch Warren S. and Walter Pitts (1943). “A logical calculus of the ideas immanent in nervous activity.” Bulletin of Mathematical Biophysics, 5, 115–133.Google Scholar
  72. [5]
    Rumelhart David E., Geoffrey E. Hinton and Ronald J. Williams (1986). “Learning representations by back-propagating errors.” Nature, 323, 533–536.Google Scholar
  73. [6]
    Hopfield J.J. (1984). “Neurons with graded response have collective computational properties like those of two-state neurons.” Proceedings of the National Academy of Sciences, 81, 3088–3092.Google Scholar
  74. [7]
    Hopfield J.J. and D.W. Tank (1985). “Neural Computation of Decisions in Optimization Problems.” Biological Cybernetics, 52, 141–152.Google Scholar
  75. [1]
    Anandalingam G., ed. (1992), Hierarchical Optimization, special issue of Annals of Operations Research 34, J.C. Baltzer, Basel, Switzerland.Google Scholar
  76. [2]
    Bank B., J. Guddat, D. Klatte, B. Kummer and K. Tammer (1982), Nonlinear Parametric Optimization, Akademie-Verlag, Berlin.Google Scholar
  77. [3]
    Bazaraa M.S. and C.M. Shetty (1979), Nonlinear Programming, Theory and Algorithms, Wiley, New York.Google Scholar
  78. [4]
    Bracken J. and G.P. McCormick (1968), Selected Applications of Nonlinear Programming, Wiley, New York.Google Scholar
  79. [5]
    Brosowski B. (1982), Parametric Semi-Infinite Optimization, Verlag Peter Lang, Frankfurt am Main.Google Scholar
  80. [6]
    Brosowski B. and F. Deutsch, eds. (1985), Parametric Optimization and Approximation, Birkhauser.Google Scholar
  81. [7]
    Dontchev A.L. and T. Zolezzi (1993), Well-Posed Optimization Problems, Springer-Verlag, Berl in Heidelberg.Google Scholar
  82. [8]
    Fiacco A.V. (1983), Introduction to Sensitivity and Stability Analysis in Nonlinear Programming, Academic Press, New York.Google Scholar
  83. [9]
    Fiacco A.V., ed., (1984), Sensitivity, Stability and Parametric Analysis, Mathematical Programming Study 21, Elsevier Science Publishers B.V., North-Holland.Google Scholar
  84. [10]
    Fiacco A.V., ed. (1990), Optimization with Data Perturbations, special issue of Annals of Operations Research 27, J. C. Baltzer, Basel, Switzerland.Google Scholar
  85. [11]
    Fiacco A.V. and W.P. Hutzler (1982), “Basic Results in the Development of Sensitivity and Stability Analysis in Nonlinear Programming,” in Mathematical Programming with Parameters and Multi-level Constraints, J.E. Falk and A.V. Fiacco, eds., Special Issue on Computers and Operations Research 9, Pergamon, New York, 9–28.Google Scholar
  86. [12]
    Fiacco A.V. and Y. Ishizuka (1990), “Sensitivity and Stability Analysis for Nonlinear Programming,” Annals of Operations Research 27, 215– 235.Google Scholar
  87. [13]
    Fiacco A.V. and K.O. Kortanek, eds. (1983), Semi-Infinite Programming and Applications, Lecture Notes in Economics and Mathematical Systems, Number 215, Springer, Berlin.Google Scholar
  88. [14]
    Fiacco A.V. and J. Kyparisis (1992), “A Tutorial on Parametric Nonlinear Programming Sensitivity and Stability Analysis,” in Systems and Management Science by Extremal Methods: Research Honoring Abraham Charnes at Age 70, F. Y. Phillips and J. J. Rousseau, eds., Kluwer Academic Publishers, Boston, 205–223.Google Scholar
  89. [15]
    Fiacco A.V. and G.P. McCormick (1968), Nonlinear Programming, Sequential Unconstrained Minimization Techniques, Wiley, New York. An unabridged corrected version was published by SI AM in the series Classics in Applied Mathematics (1990).Google Scholar
  90. [16]
    Fletcher R. (1987), Practical Methods of Optimization, Wiley, New York.Google Scholar
  91. [17]
    Gill P.E., W. Murray and M.H. Wright (1981), Practical Optimization, Academic Press, London.Google Scholar
  92. [18]
    Gonzaga C.C. (1992), “Path Following Methods for Linear Programming,” SIAM Review 34, 167– 224.Google Scholar
  93. [19]
    Guddat J., H. Th. Jongen, B. Kummer and F. Nozicka, eds. (1987), Parametric Optimization and Related Topics, Akademie-Verlag, Berlin.Google Scholar
  94. [20]
    Hancock H. (1960), Theory of Maxima and Minima, Dover, New York.Google Scholar
  95. [21]
    Hillier F.S. and G.J. Lieberman (1980), Introduction to Operations Research, Holden-Day, Oakland, California.Google Scholar
  96. [22]
    Hobson R.F. and J.J. Weinkam (1979), “Curve Fitting,” in Operations Research Support Methodology ( A.G. Holzman, ed.), Marcel-Dekker, New York, 335–362.Google Scholar
  97. [23]
    Hocking L.M. (1991), Optimal Control: An Introduction to the Theory with Applications. Oxford University Press, New York.Google Scholar
  98. [24]
    Jongen H. Th., P. Jonker and F. Twilt (1986), Nonlinear Optimization in R n : IL Transversality, Flows, Parametric Aspects, Verlag Peter Lang, New York.Google Scholar
  99. [25]
    Kan A.H., G. Rinnooy and G.T. Timmer (1989), “Global Optimization,” Ch. IX in Handbooks in OR & MS, 1, G. L. Nemhauser et al., eds., North-Holland, Amsterdam.Google Scholar
  100. [26]
    Karmakar N. (1984), “A New Polynomial-time Algorithm for Linear Programming,” Comhinatoria 4, 373–395.Google Scholar
  101. [27]
    Khachian L.G. (1979), “A Polynomial Algorithm in Linear Programming,” Soviet Mathematics Doklady 20, 191–94.Google Scholar
  102. [28]
    Kuhn H.W. (1991), “Nonlinear Programming: A Historical Note,” in History of Mathematical Programming ( J. K. Lenstra, A.H.G. Rinnooy Kan and A. Schrijver, eds.), North-Holland, Amsterdam, 82–96.Google Scholar
  103. [29]
    Kuhn H.W. and A.W. Tucker (1951), “Nonlinear Programming,” Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (J. Neyman, ed.). University of California Press, Berkeley, 481–493.Google Scholar
  104. [30]
    Lagrange J.L. (1762), “Essai sur une Nouvelle Methode pour Determiner les Maxima et Minima des Formules Intégrales Indéfinies,” in Miscellanea Taurinensia II, 173–195.Google Scholar
  105. [31]
    Levitin E.S. (1993), Perturbation Theory in Mathematical Programming, Wiley-Interscience, New York.Google Scholar
  106. [32]
    McCormick G.P. (1983), Nonlinear Programming: Theory, Algorithms and Applications, Wiley, New York.Google Scholar
  107. [33]
    Megiddo N., ed. (1989), Progress in Mathematical Programming - Interior Point and Related Methods, Springer, New York.Google Scholar
  108. [34]
    Mor J.J. and S.J. Wright (1993), Optimization Software Guide, Frontiers in Applied Mathematics 14, SIAM.Google Scholar
  109. [35]
    Neittaanmaki M. (1992), Nonsmooth Optimization, World Scientific Publishing, London.Google Scholar
  110. [36]
    Nesterov Y. and A. Nemirovski (1993), Interior-Point Polynomial Algorithms in Convex Programming, Studies in Applied Mathematics 13, SIAM.Google Scholar
  111. [37]
    Rockafellar R.T. (1970), Convex Analysis, Princeton University Press, Princeton, NJ.Google Scholar
  112. [38]
    Rosen J.B., ed. (1990), Supercomputers and Large-Scale Optimization: Algorithms, Software, Applications, special issue of Annals of Operations Research 22(l)–(4), J.C. Baltzer, Basel, Switzerland.Google Scholar
  113. [39]
    Sawaragi Y., H. Nakayama and T. Tanino (1985), Theory of Multiobjective Optimization, Academic Press, New York.Google Scholar
  114. [40]
    Schrijver A. (1986), Theory of Linear and Integer Programming, Wiley, New York.Google Scholar
  115. [41]
    Waren A.D., M.S. Hung and L.S. Lasdon (1987), “The Status of Nonlinear Programming Software: An Update,” Operations Research 35, 489–503.Google Scholar
  116. [42]
    Wets Roger J.-B. (1989), “Stochastic Programming,” in Handbooks in OR & MS, 1, Elsevier/ North-Holland, Amsterdam.Google Scholar
  117. [43]
    Winston W.L. (1991), Operations Research: Applications and Algorithms, PWI-Kent Publishing, Boston.Google Scholar
  118. [44]
    Wright M.H. (1992), “Interior Methods for Constrained Optimization,” in Acta Numerica 1 ( A. Iserles, ed.), Cambridge University Press, New York, 341–407.Google Scholar
  119. [1]
    E. Anderson et al. (1992), LAPACK Users’ Guide, SIAM, Philadelphia.Google Scholar
  120. [2]
    K. Atkinson (1985), Elementary Numerical Analysis, Wiley, New York.Google Scholar
  121. [3]
    G.H. Golub and C.F. Van Loan (1989), Matrix Computations ( second edition ), The Johns Hopkins University Press, Baltimore, Maryland.Google Scholar
  122. [4]
    E. Grosse (1994), “Netlib Joins the World Wide Web,” SIAM News, 27 (5), 1–3.Google Scholar
  123. [5]
    D.K. Kahaner, C.B. Moler and S.G. Nash (1989), Numerical Methods and Software, Prentice-Hall, Englewood Cliffs, New Jersey.Google Scholar
  124. [6]
    D.R. Kincaid and E.W. Cheney (1991), Numerical Analysis: Mathematics of Scientific Computing, Brooks/Cole, Pacific Grove, California.Google Scholar
  125. [7]
    W.H. Press, S.A. Teukolsky, W.T. Vetterling and B.P. Flannery (1992), Numerical Recipes in FORTRAN: The Art of Scientific Computing ( second edition ), Cambridge University Press, England.Google Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.College of Business and ManagementUniversity of MarylandCollege ParkUSA
  2. 2.Department of Operations Research and EngineeringGeorge Mason UniversityFairfaxUSA

Personalised recommendations