On a stochastic sequencing and scheduling problem

DOI10.1016/J.COR.2005.10.007MaRDI QIDQ875406zbMATH OpenOpenAlexFDO

Authors Antonio Alonso-Ayuso, Laureano F. Escudero Bueno, M. T. Ortuño, Celeste Pizarro

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

zbMATH Keywords

branch-and-fix coordinationfix-and-relax heuristicmultistage scenario treesequencing and scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Stochastic programming (90C15) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 826383
• scientific article; zbMATH DE number 3906216
• The Stochastic Sequential Assignment Problem With Random Deadlines
• A stochastic batching and scheduling problem
• Optimal stochastic scheduling
• Stochastic programming approaches to stochastic scheduling
• scientific article; zbMATH DE number 1060044
• Stochastic sequential assignment problem with arrivals
• Stochastic scheduling problems I — General strategies

Cites work

• A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• A stochastic 0-1 program based approach for the air traffic flow management problem
• A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment
• A stochastic programming approach for supply chain network design under uncertainty
• An application of Lagrangian relaxation to a capacity planning problem under uncertainty
• An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• Computational solution of capacity planning models under uncertainty
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Dual decomposition in stochastic integer programming
• From stochastic dominance to mean-risk models: Semideviations as risk measures
• scientific article; zbMATH DE number 1688599 (Why is no real title available?)
• scientific article; zbMATH DE number 1688600 (Why is no real title available?)
• scientific article; zbMATH DE number 1984254 (Why is no real title available?)
• Introduction to Stochastic Programming
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
• MIP modelling of changeovers in production planning and scheduling problems
• On bridging the gap between stochastic integer programming and MIP solver technologies
• On maintenance scheduling of production units
• On practical resource allocation for production planning and scheduling with period overlapping setups
• On solving the multi-period single-sourcing problem under uncertainty
• Optimizing electricity distribution using two-stage integer recourse models
• Partitioning procedures for solving mixed-variables programming problems
• Project scheduling under limited resources. Models, methods, and applications
• Project scheduling under uncertainty: survey and research potentials
• Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
• S3 sets. An extension of the Beale-Tomlin special ordered sets
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Schumann, a modeling framework for supply chain management under uncertainty
• Stochastic programming with integer variables
• The air traffic flow management problem with enroute capacities
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The value of multistage stochastic programming in capacity planning under uncertainty
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints

Cited in

(22)

• 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
• Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
• Rollout algorithms for stochastic scheduling problems
• Scheduling In the random-order model
• Risk-averse two-stage stochastic programs in furniture plants
• Stochastic programming approaches to stochastic scheduling
• Stochastic cyclic scheduling problem in synchronous assembly and production lines
• 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
• scientific article; zbMATH DE number 1031396 (Why is no real title available?)
• On air traffic flow management with rerouting. II: Stochastic case
• Stochastic sequencing with job families, set-up times, and due dates
• THE SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM WITH POSTPONEMENT OPTIONS
• Minimizing value-at-risk in single-machine scheduling
• Cross-dock facility for disaster relief operations
• Convex approximations of two-stage risk-averse mixed-integer recourse models
• On a fix-and-relax framework for a class of project scheduling problems
• 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

This page was built for publication: On a stochastic sequencing and scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875406)