Some basic scheduling algorithms

Joseph Y.T. Leung

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Scopus citations


In this chapter we shall review some of the most well-known and basic scheduling algorithms. We shall concentrate on identical and parallel machines only. The performance metrics we shall be dealing with are Cmax,ΣCj, Lmax,ΣUj, andΣTj. These will be presented in Sections 3.2 to 3.7.

Original languageEnglish (US)
Title of host publicationHandbook of Scheduling
Subtitle of host publicationAlgorithms, Models, and Performance Analysis
PublisherCRC Press
ISBN (Electronic)9780203489802
ISBN (Print)9781584883975
StatePublished - Jan 1 2004

All Science Journal Classification (ASJC) codes

  • General Engineering
  • General Computer Science
  • General Economics, Econometrics and Finance
  • General Business, Management and Accounting


Dive into the research topics of 'Some basic scheduling algorithms'. Together they form a unique fingerprint.

Cite this