Some basic scheduling algorithms

Joseph Y.T. Leung

Some basic scheduling algorithms

Joseph Y.T. Leung

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter

4 Scopus citations

Abstract

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 C_max,ΣC_j, Lmax,ΣU_j, andΣT_j. These will be presented in Sections 3.2 to 3.7.

Original language	English (US)
Title of host publication	Handbook of Scheduling
Subtitle of host publication	Algorithms, Models, and Performance Analysis
Publisher	CRC Press
Pages	3-1-3-18
ISBN (Electronic)	9780203489802
ISBN (Print)	9781584883975
State	Published - Jan 1 2004

All Science Journal Classification (ASJC) codes

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

Cite this

@inbook{b5a0abaf613b4309b21a6a51731ae33d,

title = "Some basic scheduling algorithms",

abstract = "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.",

author = "Leung, {Joseph Y.T.}",

note = "Publisher Copyright: {\textcopyright} 2004 by CRC Press LLC.",

year = "2004",

month = jan,

day = "1",

language = "English (US)",

isbn = "9781584883975",

pages = "3--1--3--18",

booktitle = "Handbook of Scheduling",

publisher = "CRC Press",

}

TY - CHAP

T1 - Some basic scheduling algorithms

AU - Leung, Joseph Y.T.

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70450005139&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70450005139&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:70450005139

SN - 9781584883975

SP - 3-1-3-18

BT - Handbook of Scheduling

PB - CRC Press

ER -

Some basic scheduling algorithms

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this