A parameterized complexity view on non-preemptively scheduling ...

Download PDF
1 downloads 5534 Views 44KB Size Report
Comment
Mar 24, 2016 - Faculty of Information Technology, Czech Technical University in. Prague, Prague ... Looseness If all jobs j ∈ J satisfy |dj −tj| ≤ λ pj for some number λ ..... nificantly easier in the online scenario: Chen et al (2016) showed an ...