The Complexity of Flowshop and Jobshop Scheduling (Q4180114): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q63353547, #quickstatements; #temporary_batch_1707232231678 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q63353547 / rank | |||
Normal rank | |||
Revision as of 17:30, 6 February 2024
scientific article; zbMATH DE number 3616166
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Flowshop and Jobshop Scheduling |
scientific article; zbMATH DE number 3616166 |
Statements
The Complexity of Flowshop and Jobshop Scheduling (English)
0 references
1976
0 references
Complexity
0 references
Flow Shop Scheduling
0 references
Jobshop Scheduling
0 references
Np-Complete Problems
0 references
