A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (Q1278296): 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/0377-2217(95)00168-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047821474 / rank | |||
Normal rank | |||
Revision as of 20:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs |
scientific article |
Statements
A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (English)
0 references
22 February 1999
0 references
single-machine scheduling
0 references
batch delivery
0 references
common due date
0 references
strongly NP-hard
0 references
