Joseph Y. Leung

Contact Info

Title: Distinguished Professor
Office: 4202 GITC
Phone: 973-596-3387
Dept: Computer Science

About Me

Joseph Leung, PhD, distinguished professor of computer science at New Jersey Institute of Technology, is recognized as an international leader in the field of scheduling theory. He won a prize from leading experts for solving an important open problem in scheduling. His research interests include scheduling theory, real-time systems, algorithms, operating systems, computational complexity, and combinatorial optimization.

With Michael Pinedo at New York University, Leung was recently awarded a grant by the National Science Foundation to study order scheduling in an industrial environment. He recently edited the Handbook of Scheduling: Algorithms, Models and Performance Analysis, published by CRC Press in 2004.

Since 1976, he has been on the faculties of Virginia Tech, Northwestern University, University of Texas at Dallas, University of Nebraska-Lincoln, and New Jersey Institute of Technology. He was associate program head of the computer science program at the University of Texas at Dallas from 1987 to 1990, chairman of the department of computer science and engineering at the University of Nebraska-Lincoln from 1990 to 1996, and chairman of computer and information science at NJIT from 1999 to 2001.


  • Ph.D. in Computer Science, The Pennsylvania State University, University Park, PA, March 1977.  Dissertation Title:  " Algorithms for Packing Problems."  Dissertation Advisor: Dr. E. G. Coffman, Jr.
  • B.A. in Mathematics (Highest Honor), Southern Illinois University at Carbondale, Carbondale, IL, June 1972.

Awards and Honors

  • Listed in American Men and Women of Science, Directory of World Academic/Industrial Researchers 1980´s, Who´s Who in Finance and Industry, Who´s Who in Technology, Who´s Who in the United States, Who´s Who in America, Who´s Who among Asian Americans, Who´s Who in the Midwest, Who´s Who in the Media and Communications, Who´s Who Among America´s Teachers, and Who´s Who in American Education.
  • 1981 Outstanding Young Men of America.
  • Won a prize for solving an important open problem in scheduling theory which had been open for thirty years.
  • Recipient of the 2007 Excellence in Research Award for the College of Computing Sciences in NJIT.
  • Won the Albert Nelson Marquis Lifetime Achievement Award


Courses Taught

  • Operating Systems
  • Compiler Construction
  • Systems Programming
  • Discrete Structures
  • Syntactic Analysis
  • Automata Theory
  • Assembly Language Programming
  • Fortran Programming
  • Data Structures
  • Scheduling Theory
  • Combinatorics and Graph Algorithms
  • Theory of NP-Completeness

Lecture Notes/Syllabi


CS 332


CS 341


CS 435 DL


CS 506 Syllabus


CS 611 Syllabus


CS 630 Syllabus


IE 704 Syllabus


CS 704 Syllabus


Research Interests

  • Scheduling Theory
  • Real-Time Systems
  • Operating Systems
  • Combinatorial Optimization
  • Computational Complexity
  • Design and Analysis of Algorithms

Selected Publications

View All Publications