Lower bounds for online makespan minimization on a small number of related machines

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10159397" target="_blank" >RIV/00216208:11320/13:10159397 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/13:00395516
Result on the web
<a href="http://dx.doi.org/10.1007/s10951-012-0288-7" target="_blank" >http://dx.doi.org/10.1007/s10951-012-0288-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10951-012-0288-7" target="_blank" >10.1007/s10951-012-0288-7</a>

Result language
angličtina
Original language name
Lower bounds for online makespan minimization on a small number of related machines
Original language description
In online makespan minimization, the jobs characterized by their processing time arrive one-by-one and each has to be assigned to one of the m uniformly related machines. The goal is to minimize the length of the schedule. We prove new combinatorial lower bounds for m=4 and m=5, and computer-assisted lower bounds for m{=11.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)