New approximate algorithms for the customer order scheduling problem with total completion time objective (Q1652070): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2016.09.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2016.09.010 / rank | |||
Normal rank | |||
Latest revision as of 01:07, 11 December 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
0 references
0 references
0 references
