A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (Q1278296)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1252888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs |
scientific article; zbMATH DE number 1252888 |
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
0.91275156
0 references
0.9048304
0 references
0.9048017
0 references
0.89859885
0 references
0.8957456
0 references
0.8950662
0 references
0.8940919
0 references
0.8908123
0 references
