Single machine scheduling with discretely controllable processing times (Q1373460)
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 1089840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine scheduling with discretely controllable processing times |
scientific article; zbMATH DE number 1089840 |
Statements
Single machine scheduling with discretely controllable processing times (English)
0 references
19 November 1997
0 references
controllable processing times
0 references
single machine
0 references
sum of the total processing cost
0 references
makespan
0 references
maximum tardiness
0 references
total completion time
0 references
pseudo-polynomial dynamic programming algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.897549569606781
0 references
0.88254714012146
0 references
0.8666362762451172
0 references
