Complexity and a branch and bound algorithm of 3TMF scheduling problem. (Chinese. English summary) Zbl 1187.90137
Summary: TMF to be a strongly NP-completeness problem is studied. A branch and bound algorithm for the problem is presented. “Scheduling multi-processor tasks” problem and Assembly Flow Shop scheduling problem are expanded.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
| 90C57 | Polyhedral combinatorics, branch-and-bound, branch-and-cut |
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
