Cargando…
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
We study a natural variant of scheduling that we call partial scheduling: in this variant an instance of a scheduling problem along with an integer k is given and one seeks an optimal schedule where not all, but only k jobs, have to be processed. Specifically, we aim to determine the fine-grained pa...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9304082/ https://www.ncbi.nlm.nih.gov/pubmed/35880200 http://dx.doi.org/10.1007/s00453-022-00970-8 |