Two branch-and-bound algorithms for the robust parallel machine scheduling problem

DOI10.1016/j.cor.2011.09.019zbMath1251.90213OpenAlexW2069959731MaRDI QIDQ1762154

Xianqiang Yang

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.019

zbMATH Keywords

identical parallel machinesrobust schedulingstochastic processing times

Mathematics Subject Classification ID

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

Related Items (11)

Robust optimization for the cyclic hoist scheduling problem ⋮ Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ An enhanced branch-and-bound algorithm for the talent scheduling problem ⋮ A hybrid differential evolution approach based on surrogate modelling for scheduling bottleneck stages ⋮ The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Scheduling jobs with normally distributed processing times on parallel machines ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Computing the execution probability of jobs with replication in mixed-criticality schedules ⋮ An adaptive robust optimization model for parallel machine scheduling

Cites Work

• Unnamed Item
• Robust scheduling of parallel machines with sequence-dependent set-up costs
• Scheduling on parallel identical machines to minimize total tardiness
• Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
• Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
• An exact algorithm for the identical parallel machine scheduling problem.
• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
• Project scheduling under uncertainty: survey and research potentials
• A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
• Parallel Machine Scheduling by Column Generation
• Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
• Improving Discrete Model Representations via Symmetry Considerations
• Tight bounds for the identical parallel machine‐scheduling problem: Part II
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Scheduling

This page was built for publication: Two branch-and-bound algorithms for the robust parallel machine scheduling problem