A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
From MaRDI portal
Publication:3163144
DOI10.1080/00207540903225205zbMath1197.90340WikidataQ57185703 ScholiaQ57185703MaRDI QIDQ3163144
Chengbin Chu, Ada Che, Pengyu Yan, Naiding Yang
Publication date: 25 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540903225205
branch and bound algorithm; cyclic scheduling; robotic cell; method of prohibited intervals; processing time windows
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research