Study on single machine scheduling problem based on general time-and-position dependent jobs processing time (Q3131415)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6830978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Study on single machine scheduling problem based on general time-and-position dependent jobs processing time |
scientific article; zbMATH DE number 6830978 |
Statements
29 January 2018
0 references
time-dependent scheduling
0 references
location-dependent scheduling
0 references
polynomial time algorithm
0 references
0.9396504163742064
0 references
0.9023476839065552
0 references
0.8741521835327148
0 references
