98 search results - page 15 / 20 » orl 2006 |
102
Voted
ORL
1998
15 years 1 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
120
click to vote
ORL
2002
15 years 1 months ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
ORL
2002
15 years 1 months ago
2002
We consider a two node multiclass queueing network given by two machines each with two classes. There are two streams of jobs: One stream originates in machine 1, which feeds it f...
100
click to vote
ORL
2007
15 years 1 months ago
2007
In ergodic MDPs we consider stationary distributions of policies that coincide in all but n states, in which one of two possible actions is chosen. We give conditions and formulas...
ORL
2007
15 years 1 months ago
2007
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...