Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers
From MaRDI portal
Publication:5057997
DOI10.1287/ijoc.2022.1193zbMath1502.90074arXiv2012.09511MaRDI QIDQ5057997
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.09511
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Uses Software