Single machine batch scheduling with non-increasing time slot costs (Q2673533)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7539460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine batch scheduling with non-increasing time slot costs |
scientific article; zbMATH DE number 7539460 |
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
0.8383923768997192
0 references
0.8346863389015198
0 references
0.8324493765830994
0 references
0.8260643482208252
0 references
0.8257957100868225
0 references
