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

DOI10.1016/j.cor.2011.09.019zbMath1251.90213MaRDI 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 machines; robust scheduling; stochastic processing times

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B36: Stochastic scheduling theory in operations research