Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q166205 |
Changed an Item |
||
| Property / author | |||
| Property / author: Guo-Hui Lin / rank | |||
Normal rank | |||
Revision as of 01:52, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph |
scientific article |
Statements
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (English)
0 references
13 April 2022
0 references
path cover
0 references
flow-shop scheduling
0 references
conflict graph
0 references
\(b\)-matching
0 references
approximation algorithm
0 references
