Scheduling with Random Service Times
From MaRDI portal
Publication:5597352
DOI10.1287/MNSC.12.9.707zbMATH Open0199.23302OpenAlexW1969292692MaRDI QIDQ5597352FDOQ5597352
Publication date: 1966
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.12.9.707
Cited In (30)
- Unrelated Machine Scheduling with Stochastic Processing Times
- 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
- 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
- Title not available (Why is that?)
- Single machine scheduling under market uncertainty
- 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
- Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types
- 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
- 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
- Stochastic machine scheduling to minimize waiting time related objectives with emergency jobs
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
- Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
- Approximations to Stochastic Dynamic Programs via Information Relaxation Duality
- A Tight 2-Approximation for Preemptive Stochastic Scheduling
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling
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)