机译:Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
Hangzhou Dianzi Univ;
Xiamen Univ;
Taizhou UnivUniv AlbertaXian Technol Univ;
Path cover; Flow-shop scheduling; Conflict graph; b-matching; Approximation algorithm;