On a stochastic sequencing and scheduling problem
From MaRDI portal
Publication:875406
DOI10.1016/j.cor.2005.10.007zbMath1141.90436OpenAlexW2072281788MaRDI QIDQ875406
Antonio Alonso-Ayuso, Celeste Pizarro, Laureano Fernando Escudero Bueno, M. Teresa Ortuño
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.007
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)
Related Items (11)
On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming ⋮ BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems ⋮ Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty ⋮ Integrated production scheduling and maintenance policy for robustness in a single machine ⋮ Cross-dock facility for disaster relief operations ⋮ On air traffic flow management with rerouting. II: Stochastic case ⋮ Risk-averse two-stage stochastic programs in furniture plants ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty ⋮ On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty ⋮ On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- On solving the multi-period single-sourcing problem under uncertainty
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- Partitioning procedures for solving mixed-variables programming problems
- On maintenance scheduling of production units
- MIP modelling of changeovers in production planning and scheduling problems
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- On practical resource allocation for production planning and scheduling with period overlapping setups
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Stochastic programming with integer variables
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- A stochastic 0-1 program based approach for the air traffic flow management problem
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- Project scheduling under uncertainty: survey and research potentials
- Schumann, a modeling framework for supply chain management under uncertainty
- Project scheduling under limited resources. Models, methods, and applications
- Computational solution of capacity planning models under uncertainty
- A stochastic programming approach for supply chain network design under uncertainty
- A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- The Air Traffic Flow Management Problem with Enroute Capacities
- On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies
- The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Introduction to Stochastic Programming
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- An application of Lagrangian relaxation to a capacity planning problem under uncertainty
This page was built for publication: On a stochastic sequencing and scheduling problem
