A note: minmax due-date assignment problem with lead-time cost (Q336460)
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 note: minmax due-date assignment problem with lead-time cost |
scientific article; zbMATH DE number 6650458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note: minmax due-date assignment problem with lead-time cost |
scientific article; zbMATH DE number 6650458 |
Statements
A note: minmax due-date assignment problem with lead-time cost (English)
0 references
10 November 2016
0 references
scheduling
0 references
single machine
0 references
due-date assignment
0 references
minmax
0 references
lead-time
0 references
0 references
0 references
0 references
0 references
0 references
0.8741945624351501
0 references
0.8449837565422058
0 references
0.8263527750968933
0 references
0.825445830821991
0 references
0.8180729746818542
0 references
