Scheduling problems with linear increasing processing times (Q4233364)
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 1264428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling problems with linear increasing processing times |
scientific article; zbMATH DE number 1264428 |
Statements
19 August 1999
0 references
time-dependent processing time
0 references
maximum lateness
0 references
maximum completion time
0 references
NP-hardness
0 references
0.8800268769264221
0 references
0.8697170615196228
0 references
0.8697121143341064
0 references
0.868358850479126
0 references
Scheduling problems with linear increasing processing times (English)
0 references
