On Scheduling Chains of Jobs on One Processor with Limited Preemption

DOI10.1137/0204041MaRDI QIDQ4102900zbMATH OpenOpenAlexFDO

Authors John Bruno, Micha Hofri

Publication date 1975

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0204041

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Cited in

(10)

• On the evaluation of fixed permutations as strategies in stochastic scheduling
• On batch scheduling of jobs with stochastic service times and cost structures on a single server
• Multiple feedback at a single-server station
• Single machine scheduling when processing times are correlated normal random variables
• On scheduling influential stochastic tasks on a single machine
• The performance of forwards induction policies
• Competing Markov decision processes
• A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
• A General Model for the Scheduling of Alternative Stochastic Jobs that may Fail
• Semi-Markov models for single-machine stochastic scheduling problems

This page was built for publication: On Scheduling Chains of Jobs on One Processor with Limited Preemption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4102900)