Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds

We consider the Vector Scheduling problem, a natural generalization of the classical makespan minimization problem to multiple resources. Here, we are given n jobs, represented as d-dimensional vectors in [Formula: see text] , and m identical machines, and the goal is to assign the jobs to machines...

Descripción completa

Detalles Bibliográficos
Autores principales: Bansal, Nikhil, Oosterwijk, Tim, Vredeveld, Tjark, van der Zwaan, Ruben
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2016
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7175655/
https://www.ncbi.nlm.nih.gov/pubmed/32355383
http://dx.doi.org/10.1007/s00453-016-0116-0

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7175655/
https://www.ncbi.nlm.nih.gov/pubmed/32355383
http://dx.doi.org/10.1007/s00453-016-0116-0

Ejemplares similares