New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070)
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: New approximate algorithms for the customer order scheduling problem with total completion time objective |
scientific article; zbMATH DE number 6901291
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New approximate algorithms for the customer order scheduling problem with total completion time objective |
scientific article; zbMATH DE number 6901291 |
Statements
New approximate algorithms for the customer order scheduling problem with total completion time objective (English)
0 references
11 July 2018
0 references
order scheduling
0 references
completion times
0 references
heuristics
0 references
0 references
0 references
0 references
0.8967918
0 references
0.87155044
0 references
0.8634938
0 references
0 references
0.8583862
0 references
0.8549627
0 references
0.8545847
0 references
0 references
