Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667): Difference between revisions
From MaRDI portal
Latest revision as of 12:09, 8 July 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
0 references
0 references
0 references
0 references