Scheduling with Random Service Times
From MaRDI portal
Publication:5597352
DOI10.1287/mnsc.12.9.707zbMath0199.23302OpenAlexW1969292692MaRDI QIDQ5597352
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
Related Items (30)
Unnamed Item ⋮ Single machine sequencing with random processing times and random due‐dates ⋮ Unrelated Machine Scheduling with Stochastic Processing Times ⋮ Single machine scheduling under market uncertainty ⋮ Scheduling with compressible and stochastic release dates ⋮ Setting optimal due dates in a basic safe-scheduling model ⋮ Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times ⋮ A 2-OPT procedure to reduce total inspection time in a serial inspection process ⋮ Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines ⋮ General stochastic single-machine scheduling with regular cost functions ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ Single-machine scheduling with general costs under compound-type distributions ⋮ Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types ⋮ When greediness fails: examples from stochastic scheduling. ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality ⋮ Approximation results in parallel machines stochastic scheduling ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Analysis of Smith's rule in stochastic machine scheduling ⋮ A genetic algorithm for task scheduling on NoC using FDH cross efficiency ⋮ Allocation and scheduling of conditional task graphs ⋮ Analysis of computer job control under uncertainty ⋮ Preemptive stochastic online scheduling on two uniform machines ⋮ On index policies for stochastic minsum scheduling ⋮ Stochastic machine scheduling to minimize waiting time related objectives with emergency jobs ⋮ Minimizing total expected costs in the two-machine, stochastic flow shop ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ Stochastic Online Scheduling Revisited ⋮ Minimizing earliness and tardiness costs in stochastic scheduling
This page was built for publication: Scheduling with Random Service Times
