New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:13, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New approximate algorithms for the customer order scheduling problem with total completion time objective |
scientific article |
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
