scientific article; zbMATH DE number 3906216
zbMATH Open0567.90049MaRDI QIDQ3683873FDOQ3683873
Authors: Rolf H. Möhring, F. J. Radermacher 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
surveyoptimalitystabilitymonotonicityflow shopmachine schedulingnetwork optimizationopen shopfinite horizonjob shopstochastic dynamic optimizationexistence of optimal policiesgeneral non-preemptive stochastic schedulingincountable state and action space
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Stochastic programming (90C15)
Cited In (19)
- Single-machine scheduling with general costs under compound-type distributions
- Stochastic scheduling problems I — General strategies
- When greediness fails: examples from stochastic scheduling.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some concepts of stability analysis in combinatorial optimization
- Linear preselective policies for stochastic project scheduling
- Time complexity of single machine scheduling with stochastic precedence constraints
- On a stochastic sequencing and scheduling problem
- Predetermined intervals for start times of activities in the stochastic project scheduling problem
- A concise survey of scheduling with time-dependent processing times
- Rollout algorithms for stochastic scheduling problems
- Stochastic scheduling and forwards induction
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering
- Single-machine stochastic scheduling with dependent processing times
- Stochastic scheduling problems II-set strategies-
- Stochastic scheduling in an in-forest
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683873)
