Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2013.04.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010600472 / rank | |||
Normal rank | |||
Revision as of 02:47, 20 March 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
