Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995)
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 7153662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Modeling single machine preemptive scheduling problems for computational efficiency |
scientific article; zbMATH DE number 7153662 |
Statements
Modeling single machine preemptive scheduling problems for computational efficiency (English)
0 references
20 January 2020
0 references
preemptive scheduling
0 references
time-indexed formulation
0 references
weighted tardiness
0 references
weighted earliness
0 references
weighted completion
0 references
aggregate planning
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7956269383430481
0 references
0.7858063578605652
0 references
0.781990647315979
0 references
0.7813853621482849
0 references
