A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs

DOI10.1016/j.cor.2009.03.019zbMath1171.90404MaRDI QIDQ733523

D. Kharzeev

Publication date: 16 October 2009

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

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

zbMATH Keywords

branch-and-bound algorithm; scheduling; deteriorating jobs; flow shop; total completion time

Mathematics Subject Classification ID

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

90B35: Deterministic scheduling theory in operations research