A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs (Q2464405)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs |
scientific article |
Statements
A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs (English)
0 references
20 December 2007
0 references
