Number of the records: 1
Semi-online preemptive scheduling: one algorithm for all variants
- 1.EBENLENDR, Tomáš, SGALL, J. Semi-online preemptive scheduling: one algorithm for all variants. Theory of Computing Systems. 2011, 48(3), 577-613. ISSN 1432-4350. E-ISSN 1433-0490. Available: doi: 10.1007/s00224-010-9287-2.
Number of the records: 1