Scheduling with Random Service Times

Cited In (30)

Minimizing earliness and tardiness costs in stochastic scheduling
Single-machine scheduling with general costs under compound-type distributions
Allocation and scheduling of conditional task graphs
Preemptive stochastic online scheduling on two uniform machines
Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
Analysis of Smith's rule in stochastic machine scheduling
When greediness fails: examples from stochastic scheduling.
General stochastic single-machine scheduling with regular cost functions
Optimal mechanism design for a sequencing problem with two-dimensional types
Approximations to stochastic dynamic programs via information relaxation duality
A tight 2-approximation for preemptive stochastic scheduling
Single machine scheduling under market uncertainty
Greed works -- online algorithms for unrelated machine stochastic scheduling
Analysis of computer job control under uncertainty
A 2-OPT procedure to reduce total inspection time in a serial inspection process
Minimizing total expected costs in the two-machine, stochastic flow shop
Scheduling with compressible and stochastic release dates
Stochastic Online Scheduling Revisited
Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
Setting optimal due dates in a basic safe-scheduling model
Approximation results in parallel machines stochastic scheduling
A genetic algorithm for task scheduling on NoC using FDH cross efficiency
Single machine sequencing with random processing times and random due‐dates
Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
Dynamic priority allocation via restless bandit marginal productivity indices
On index policies for stochastic minsum scheduling
Unrelated machine scheduling with stochastic processing times
Stochastic machine scheduling to minimize waiting time related objectives with emergency jobs
Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times

This page was built for publication: Scheduling with Random Service Times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5597352)