Number of the records: 1
Open problems in throughput scheduling
SYS 0387100 LBL 01510^^^^^2200277^^^450 005 20240103201935.4 014 $a 84866645713 $2 SCOPUS 017 70
$a 10.1007/978-3-642-33090-2_2 $2 DOI 100 $a 20130320d m y slo 03 ba 101 0-
$a eng $d eng 102 $a DE 200 1-
$a Open problems in throughput scheduling 215 $a 10 s. $c P 463 -1
$1 001 cav_un_epca*0382018 $1 010 $a 978-3-642-33089-6 $1 200 1 $a Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings $v S. 2-11 $1 210 $a Berlin $c Springer $d 2012 $1 225 $a Lecture Notes in Computer Science $v 7501 $1 702 1 $a Epstein $b L. $4 340 $1 702 1 $a Ferragina $b P. $4 340 610 0-
$a problem complexity 610 0-
$a scheduling 700 -1
$3 cav_un_auth*0100708 $a Sgall $b Jiří $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $4 070 $T Matematický ústav AV ČR, v. v. i. 856 $u http://link.springer.com/chapter/10.1007%2F978-3-642-33090-2_2
Number of the records: 1