Skip to main content
  • 18 Accesses

(1) A simple queueing subsystem in a queueing network consisting of a server center with one or more servers, a queueing capacity infinite or finite, and a queue discipline. (2) An element of a graph or network, pairs of which are connected by arcs or edges. Nodes are sometimes referred to as points or vertices. Graph theory; Network optimization. (3) Shown graphically in a project network plan as a circle depicting the beginning or end of an activity. A node represents an instantaneous point in time at the junction of arrows. Network planning.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 532.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this entry

Cite this entry

Gass, S.I., Harris, C.M. (2001). Node . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_673

Download citation

  • DOI: https://doi.org/10.1007/1-4020-0611-X_673

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-7923-7827-3

  • Online ISBN: 978-1-4020-0611-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics