Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (Q1960324)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Shop-scheduling problems with fixed and non-fixed machine orders of the jobs |
scientific article; zbMATH DE number 1385924
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shop-scheduling problems with fixed and non-fixed machine orders of the jobs |
scientific article; zbMATH DE number 1385924 |
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
0.8973573
0 references
0.8972352
0 references
0.88836503
0 references
0.88466793
0 references
0.88171244
0 references
0.8793588
0 references
0.87877846
0 references
0.87786716
0 references
