Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:27, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard |
scientific article |
Statements
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (English)
0 references
14 May 2014
0 references
single machine
0 references
earliness
0 references
tardiness
0 references
NP-hard
0 references
