Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound

DOI10.1016/S0377-2217(98)00279-3zbMath0998.90040OpenAlexW2040309077WikidataQ59255146 ScholiaQ59255146MaRDI QIDQ1847179

Georg Ch. Pflug, A. Hellmayr, Walter J. Gutjahr

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00279-3

zbMATH Keywords

branch-and-boundscheduling theorystochastic schedulingsingle-machine tardiness problem

Mathematics Subject Classification ID

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

Related Items

Enriched workflow modelling and stochastic branch-and-bound, Minimizing value-at-risk in single-machine scheduling, Solving the vehicle routing problem with stochastic demands using the cross-entropy method, Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports, A family of inequalities valid for the robust single machine scheduling polyhedron, Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years, A survey on metaheuristics for stochastic combinatorial optimization, Minorant methods of stochastic global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic for the single machine tardiness problem
• Simulated annealing for noisy cost functions
• Stochastic programming approaches to stochastic scheduling
• On Optimal Allocation of Indivisibles Under Uncertainty
• Minimizing Total Tardiness on One Machine is NP-Hard
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
• Inequalities: theory of majorization and its applications