Cargando…
Scheduling in the Random-Order Model
Makespan minimization on identical machines is a fundamental problem in online scheduling. The goal is to assign a sequence of jobs to m identical parallel machines so as to minimize the maximum completion time of any job. Already in the 1960s, Graham showed that Greedy is [Formula: see text] -compe...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8550002/ https://www.ncbi.nlm.nih.gov/pubmed/34720298 http://dx.doi.org/10.1007/s00453-021-00841-8 |