Sciweavers

3016 search results - page 96 / 604
» The Online Transportation Problem
Sort
View
125
Voted
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
15 years 8 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
128
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
141
Voted
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
15 years 10 months ago
An online implementable differential evolution tuned optimal guidance law
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
Raghunathan Thangavelu, S. Pradeep
133
Voted
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 9 months ago
Learning, anticipation and time-deception in evolutionary online dynamic optimization
In this paper we focus on an important source of problem– difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the tr...
Peter A. N. Bosman
107
Voted
EUROPAR
2007
Springer
15 years 10 months ago
A Framework for Scheduling with Online Availability
Abstract. With the increasing popularity of large-scale distributed computing networks, a new aspect has to be considered for scheduling problems: machines may not be available per...
Florian Diedrich, Ulrich M. Schwarz