scientific article; zbMATH DE number 7296144
From MaRDI portal
Publication:5143970
DOI10.15960/j.cnki.issn.1007-6093.2020.02.009zbMath1463.90082MaRDI QIDQ5143970
No author found.
Publication date: 14 January 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityapproximation algorithmcompetitive ratioonline schedulingscheduling with rejectionoffline scheduling
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (2)
Single machine scheduling with rejection to minimize the weighted makespan ⋮ Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost
This page was built for publication:
