Single machine batch scheduling with non-increasing time slot costs (Q2673533): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-021-01805-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-021-01805-1 / rank | |||
Normal rank | |||
Latest revision as of 16:26, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine batch scheduling with non-increasing time slot costs |
scientific article |
Statements
Single machine batch scheduling with non-increasing time slot costs (English)
0 references
10 June 2022
0 references
polynomial-time algorithm
0 references
time slot cost
0 references
batch
0 references
scheduling
0 references
0 references
