A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time (Q3131383)
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: A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time |
scientific article; zbMATH DE number 6830951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time |
scientific article; zbMATH DE number 6830951 |
Statements
29 January 2018
0 references
due date assignment
0 references
fuzzy scheduling
0 references
fuzzy number
0 references
possibility mean value
0 references
possibility variance
0 references
0.9096278548240662
0 references
0.8959369659423828
0 references
0.8336237668991089
0 references
0.8189487457275391
0 references
0.8174433708190918
0 references
