Scheduling jobs with normally distributed processing times on parallel machines

DOI10.1016/j.ejor.2021.05.011zbMath1487.90337OpenAlexW3164132588MaRDI QIDQ2242242

Matěj Novotný, Richard Stec, Zdeněk Hanzálek, Antonín Novák, Přemysl Šucha

Publication date: 9 November 2021

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.05.011

zbMATH Keywords

schedulingparallel machinesbranch-and-price\(\beta\)-robust schedulingprocessing time uncertainty

Mathematics Subject Classification ID

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

Uses Software

• Gurobi
• GitHub
• Nevergrad

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 13/12 approximation algorithm for bin packing with extendable bins
• Cold supply chain design with environmental considerations: a simulation-optimization approach
• A robust basic cyclic scheduling problem
• The static stochastic knapsack problem with normally distributed item sizes
• The single-machine total tardiness scheduling problem: review and extensions
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• Data-driven robust optimization
• Two branch-and-bound algorithms for the robust parallel machine scheduling problem
• Robust scheduling on a single machine to minimize total flow time
• Algorithmic graph theory and perfect graphs
• Distributionally robust scheduling on parallel machines under moment uncertainty
• A simulation-optimization approach for integrated sourcing and inventory decisions
• A distributionally robust optimization approach for outpatient colonoscopy scheduling
• Robust global sourcing under compliance legislation
• Scheduling with uncertain processing times in mixed-criticality systems
• On distributionally robust chance-constrained linear programs
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Introduction to Stochastic Programming
• The Knapsack Problem with Conflict Graphs
• Branch and Price for Chance-Constrained Bin Packing
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
• Stochastic Machine Scheduling with Precedence Constraints
• Programming with linear fractional functionals
• Analysis of reactive scheduling problems in a job shop environment
• Distributionally robust chance constraints for non-linear uncertainties

This page was built for publication: Scheduling jobs with normally distributed processing times on parallel machines