Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time (Q4661237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time |
scientific article; zbMATH DE number 2151690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time |
scientific article; zbMATH DE number 2151690 |
Statements
Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time (English)
0 references
4 April 2005
0 references
parallel machine scheduling
0 references
hierarchical criteria
0 references
maximum tardiness
0 references
tardy jobs
0 references
flow-time
0 references
lower bounds
0 references
0.95340127
0 references
0.92895645
0 references
0.9165709
0 references
0.9165381
0 references
0.91579765
0 references
0.9138066
0 references
0.9123191
0 references
0.9113755
0 references
0.91137123
0 references
