Favrholdt Lene M.

Lene M. Favrholdt

Information about the author Lene M. Favrholdt will soon be added to the site.
Found 5 papers in total
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
2003
The unit price seat reservation problem is investigated. The seat reservation problem...
Separating online scheduling algorithms with the relative worst order ratio
Separating online scheduling algorithms with the relative worst order ratio
2006
The relative worst order ratio is a measure for the quality of online algorithms....
On-line maximizing the number of items packed in variable-sized bins
On-line maximizing the number of items packed in variable-sized bins
2003
We study on-line bin packing problem. A fixed number of n . of bins, possibly of...
Fair versus unrestricted bin packing
Fair versus unrestricted bin packing
2002
We consider the on-line Dual Bin Packing problem where we have n unit size bins and a...
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
2002
We study a preemptive semi-online scheduling problem. Jobs with non-increasing sizes...
Papers per page: