New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks

Angelelli, E. and Speranza, MG and Tuza, Zsolt (2006) New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Mathematics and Theoretical Computer Science, 8. pp. 1-16.

Full text not available from this repository.
Item Type: ISI Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Systems and Control Lab
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:26
Last Modified: 11 Dec 2012 15:26
URI: http://eprints.sztaki.hu/id/eprint/4421

Update Item Update Item