On the evaluation of fixed permutations as strategies in stochastic scheduling

DOI10.1016/0304-4149(82)90033-3zbMath0483.90051OpenAlexW2070883988MaRDI QIDQ1163466

Kevin D. Glazebrook

Publication date: 1982

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(82)90033-3

zbMATH Keywords

optimal strategystochastic schedulingswitching costssufficient existence conditionsfixed permutations as strategiesnon-preemptive strategiesstochastic single-machine allocation problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (3)

Stochastic scheduling and forwards induction ⋮ A General Model for the Scheduling of Alternative Stochastic Jobs that may Fail ⋮ A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering

Cites Work

• Unnamed Item
• Unnamed Item
• Multiple feedback at a single-server station
• On stochastic scheduling with precedence relations and switching costs
• On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
• On nonpreemptive strategies in stochastic scheduling
• N-Job, One Machine Sequencing Problems Under Uncertainty
• On Scheduling Chains of Jobs on One Processor with Limited Preemption
• Stochastic scheduling with order constraints
• Dynamic investment strategies for a risky R and D project
• On Bayesian models in stochastic scheduling
• Decomposable jump decision processes

This page was built for publication: On the evaluation of fixed permutations as strategies in stochastic scheduling