Heuristic procedures for parallel-machine scheduling problems with stochastic precedence constraints
From MaRDI portal
Recommendations
- Stochastic identical parallel machine scheduling with OR precedence constraints
- Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints
- Stochastic Machine Scheduling with Precedence Constraints
- Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
- Time complexity of single machine scheduling with stochastic precedence constraints
Cited in
(9)- Stochastic Machine Scheduling with Precedence Constraints
- Stochastic identical parallel machine scheduling with OR precedence constraints
- An analytical method for cost analysis in multi-stage supply chains: a stochastic network model approach
- Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
- scientific article; zbMATH DE number 4158355 (Why is no real title available?)
- Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
- Time complexity of single machine scheduling with stochastic precedence constraints
- On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints
- A representation model for the solving-time distribution of a set of design tasks in new product development (NPD)
This page was built for publication: Heuristic procedures for parallel-machine scheduling problems with stochastic precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273122)
