New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for solving this problem, which make a number of a-priori sequencing decisions in a pre-processing phase while the rema...

We study the problem of scheduling n given jobs on m uniform processors to minimize expected makespan (maximum finishing time). Job execution times are not known in advance, but are known to be exponentially distributed, with identical rate parameters depending solely on the executing processor. For m = 2 and 3, we show that there exist optimal scheduling rules of a certain threshold type, and ...

Crew scheduling is an important production planning of airlines. Being optimized crew scheduling could make full use of human resources, and reduce operating costs. The traditional airline crew scheduling model is deterministic and does not include potential disruptions due to weather, air traffic control, etc. To take into account of effects of random factors such as weather, air traffic contr...

We consider a stochastic online scheduling environment, where jobs with stochastic processing requirements arrive over time and the objective is to minimize the total weighted completion time. We show that any nondelay algorithm is asymptotically optimal for the stochastic online single machine, flow shop and uniform parallel machine problems under some mild assumptions.

In this paper, we present a joint power scheduling and rate control scheme for wireless ad-hoc networks. Compared with wireline networks, a unique characteristic of wireless networks is that the channel condition is timevarying. By appropriately exploiting the variation of the channel condition at each link, one can more efficiently utilize wireless resources resulting in higher system capacity...

Stochastic scheduling problems are difficult stochastic control problems with combinatorial decision spaces. In this paper we focus on a class of stochastic scheduling problems, the quiz problem and its variations. We discuss the use of heuristics for their solution, and we propose rollout algorithms based on these heuristics, which approximate the stochastic dynamic programming algorithm. We s...