Flow-based formulations for operational fixed interval scheduling problems with random delays
From MaRDI portal
Publication:1789616
DOI10.1007/s10287-016-0262-5zbMath1397.90170OpenAlexW2514536086MaRDI QIDQ1789616
Publication date: 10 October 2018
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-016-0262-5
stochastic programminginteger programmingArchimedean copularandom delaysfixed interval schedulingflow-based formulation
Integer programming (90C10) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Workforce scheduling and routing problems: literature survey and computational study
- Optimal interval scheduling with a resource constraint
- Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- A smoothing function approach to joint chance-constrained programs
- Chance constrained \(0-1\) quadratic programs using copulas
- Personnel scheduling: models and complexity
- On the complexity of interval scheduling with a resource constraint
- Stochastic linear programming. Models, theory, and computation.
- Multivariate Archimedean copulas, \(d\)-monotone functions and \(\ell _{1}\)-norm symmetric distributions
- An integer programming approach for linear programs with probabilistic constraints
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Prioritized interdiction of nuclear smuggling via tabu search
- A probabilistic interpretation of complete monotonicity
- An introduction to copulas. Properties and applications
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- The robust coloring problem.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Augmented Lagrangian method for probabilistic optimization
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Large-scale unit commitment under uncertainty
- Probabilistic constraints via SQP solver: application to a renewable energy management problem
- Convexity and optimization with copulæ structured probabilistic constraints
- Interval scheduling: A survey
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Lectures on Stochastic Programming
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
- Eventual convexity of chance constrained feasible sets
This page was built for publication: Flow-based formulations for operational fixed interval scheduling problems with random delays
