Rongheng Li

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6188291	2024-02-07	Paper
An on-line algorithm for some uniform processor Scheduling	2023-12-12	Paper
Tighter price of anarchy for selfish task allocation on selfish machines	2022-10-04	Paper
https://portal.mardi4nfdi.de/entity/Q5143975	2021-01-14	Paper
Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines	2014-07-10	Paper
Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)	2014-01-13	Paper
Semi-online scheduling for jobs with release times	2013-12-02	Paper
A General k-Level Uncapacitated Facility Location Problem	2009-02-12	Paper
List scheduling for jobs with arbitrary release times and similar lengths	2008-11-10	Paper
A \(k\)-product uncapacitated facility location problem	2007-10-25	Paper
Improved algorithm for a generalized on-line scheduling problem on identical machines	2006-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q5701962	2005-10-31	Paper
On-line scheduling for jobs with arbitrary release times	2005-02-11	Paper
On the construction of most reliable networks	2004-08-06	Paper
A tighter bound for FFd algorithm	2001-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q4489637	2000-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q4489820	2000-08-31	Paper
An On-Line Algorithm for Some Uniform Processor Scheduling	1998-05-10	Paper
The proof of \(\text{FFD}(L)\leq\frac{11}9\text{OPT}(L)+\frac79\)	1998-05-04	Paper

This page was built for person: Rongheng Li