Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds (Q2845031)
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 the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds |
scientific article; zbMATH DE number 6200388
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds |
scientific article; zbMATH DE number 6200388 |
Statements
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds (English)
0 references
22 August 2013
0 references
single machine scheduling
0 references
tardy jobs
0 references
dominance conditions
0 references
mixed-integer programming
0 references
0.9416244
0 references
0.9397569
0 references
0.93751025
0 references
0.9363327
0 references
0.92842966
0 references
0.92622197
0 references
0.92527634
0 references
0.9251417
0 references
