Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (Q1960324): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Add wikidata reference. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Natalia V. Shakhlevich / rank | |||
| Property / author | |||
| Property / author: Yuri N. Sotskov / rank | |||
| Property / author | |||
| Property / author: Natalia V. Shakhlevich / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Yuri N. Sotskov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1018943016617 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1607976652 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57633968 / rank | |||
Normal rank | |||
Latest revision as of 19:04, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shop-scheduling problems with fixed and non-fixed machine orders of the jobs |
scientific article |
Statements
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (English)
0 references
11 January 2000
0 references
shop-scheduling
0 references
polynomial algorithm
0 references
NP-hard problem
0 references
