On Scheduling Chains of Jobs on One Processor with Limited Preemption

DOI10.1137/0204041zbMath0335.90028OpenAlexW2041993861MaRDI QIDQ4102900

Micha Hofri, John L. Bruno

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

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

Related Items (10)

The performance of forwards induction policies ⋮ Competing Markov decision processes ⋮ 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 ⋮ 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 ⋮ On scheduling influential stochastic tasks on a single machine ⋮ 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