James R. Jackson Explained

James R. Jackson
Birth Date:16 May 1924
Birth Place:Denver, Colorado
Death Place:Tehachapi, California
Fields:Queueing theory
Workplaces:UCLA
Alma Mater:UCLA
Doctoral Advisor:William Thomas Puckett, Jr.
Thesis Title:Abstract Function Spaces and Their Homotopy Theory
Thesis Year:1952
Known For:Jackson's theorem

James Richard "Jim" Jackson (May 16, 1924 – March 20, 2011) was an American mathematician, well known for his contribution to queueing theory.

Jackson was born in Denver and raised in Beverly Hills.[1] He served in the United States Air Force during World War II. After his service, he earned an A.B. in 1946, an M.A. in 1950 and a Ph.D. in 1952, with a thesis titled Abstract Function Spaces and Their Homotopy Theory. All of these degrees were from UCLA where Jackson remained in the School of Management for his career until his retirement in 1985.[2]

While at University of California, Los Angeles he developed the Jackson's theorem and some of the first models that could predict the performance of networks with several nodes. Jackson's work was inspired by his experience in the Los Angeles aircraft industry,[3] but the results found applications in the design of computers, manufacturing and the then emerging packet switched networks, such as those undertaken by Leonard Kleinrock in 1961.[4]

He spent his retirement in Tehachapi, California.

Publications

Notes and References

  1. Web site: Obituary: James R. Jackson. Los Angeles Times. April 2, 2011.
  2. Web site: In Memoriam: James R. Jackson. UCLA Anderson School of Management.
  3. James R. Jackson. Production and Operations Management. 17. 6. November–December 2008. i–ii. 10.3401/poms.1080.0060.
  4. Leonard Kleinrock. Leonard. Kleinrock. Creating a mathematical theory of computer networks. Operations Research. 50. 1. 125–131. 2002. 10.1287/opre.50.1.125.17772. 3088461. free.