Sciweavers

98 search results - page 15 / 20
» orl 2006
Sort
View
ORL
1998
130views more  ORL 1998»
14 years 10 months ago
Accelerating convergence in the Fermat-Weber location problem
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 ...
Jack Brimberg, Reuven Chen, Doron Chen
ORL
2002
81views more  ORL 2002»
14 years 10 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
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...
Leah Epstein, John Noga, Gerhard J. Woeginger
ORL
2002
71views more  ORL 2002»
14 years 10 months ago
A push-pull queueing system
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...
Anat Kopzon, Gideon Weiss
ORL
2007
70views more  ORL 2007»
14 years 10 months ago
Linear dependence of stationary distributions in ergodic Markov decision processes
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...
Ronald Ortner
ORL
2007
86views more  ORL 2007»
14 years 10 months ago
Complexity of two dual criteria scheduling problems
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...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao