Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds (Q2845031): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2118257511 / rank | |||
Normal rank | |||
Latest revision as of 19:33, 19 March 2024
scientific article
| 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 |
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
