A branch-and-bound algorithm for uniform machines scheduling problem with in-tree precedence constraints

MaRDI QIDQ3308052zbMATH OpenFDO

Authors Jiaming Hu, Cuixia Miao, Juan Zou

Publication date 12 August 2020

zbMATH Keywords

branch-and-bound algorithmin-tree precedence constraintuniform parallel machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 4023000
• Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
• scientific article; zbMATH DE number 3883931
• The two-machine flow shop problem with arbitrary precedence relations
• A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)

Cited in

(2)

• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
• Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut

This page was built for publication: A branch-and-bound algorithm for uniform machines scheduling problem with in-tree precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3308052)