A two-machine flowshop problem with two agents

DOI10.1016/j.cor.2010.04.002zbMath1231.90204MaRDI QIDQ709115

D. Kharzeev

Publication date: 15 October 2010

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

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

zbMATH Keywords

scheduling; two-machine flowshop; total completion time; two-agent

Mathematics Subject Classification ID

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

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming