On stochastic scheduling with precedence relations and switching costs

DOI10.2307/3213211zbMath0449.90050OpenAlexW4249537060MaRDI QIDQ3896826

Kevin D. Glazebrook

Publication date: 1980

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213211

zbMATH Keywords

stochastic schedulingsingle machine schedulingswitching costsprecedence relations

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40)

Related Items

Applicable stochastic control: From theory to practice, Flexible servers in tandem lines with setup costs, Open Problem—M/G/1 Scheduling with Preemption Delays, On the evaluation of fixed permutations as strategies in stochastic scheduling, Some indexable families of restless bandit problems, Allocating flexible servers in serial systems with switching costs, 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