Sciweavers

408 search results - page 21 / 82
» On a stochastic sequencing and scheduling problem
Sort
View
ASIAN
2004
Springer
109views Algorithms» more  ASIAN 2004»
15 years 5 months ago
Online Stochastic and Robust Optimization
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Russell Bent, Pascal Van Hentenryck
KR
1989
Springer
15 years 3 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
15 years 4 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers
122
Voted
GLOBECOM
2009
IEEE
14 years 9 months ago
Minimum-Length Scheduling for Multicast Traffic under Channel Uncertainty
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
Anna Pantelidou, Anthony Ephremides
CCE
2004
14 years 11 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis