Cargando…
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makesp...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5767275/ https://www.ncbi.nlm.nih.gov/pubmed/29375267 http://dx.doi.org/10.1007/s10100-017-0481-z |