Cited in
(32)- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Single-machine scheduling with general costs under compound-type distributions
- Minimizing earliness and tardiness costs in stochastic scheduling
- Allocation and scheduling of conditional task graphs
- Preemptive stochastic online scheduling on two uniform machines
- When greediness fails: examples from stochastic scheduling.
- Analysis of Smith's rule in stochastic machine scheduling
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- 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
- Sequencing stochastic jobs with a single sample
- A 2-OPT procedure to reduce total inspection time in a serial inspection process
- Analysis of computer job control under uncertainty
- Minimizing total expected costs in the two-machine, stochastic flow shop
- Scheduling with compressible and stochastic release dates
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
- Setting optimal due dates in a basic safe-scheduling model
- Stochastic Online Scheduling Revisited
- Approximation results in parallel machines stochastic scheduling
- A genetic algorithm for task scheduling on NoC using FDH cross efficiency
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
- Single machine sequencing with random processing times and random due‐dates
- 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)
