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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-021-00793-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3194595331 / rank | |||
Normal rank | |||
Revision as of 20:42, 19 March 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
