Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127646641, #quickstatements; #temporary_batch_1722799621482 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(96)00035-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005924883 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127646641 / rank | |||
Normal rank | |||
Latest revision as of 20:28, 4 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-machine scheduling with trade-off between number of tardy jobs and resource allocation |
scientific article |
Statements
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (English)
0 references
7 August 1997
0 references
sequencing
0 references
time-cost trade-offs
0 references
resource allocation
0 references
single-machine scheduling
0 references
NP-hardness
0 references
pseudo-polynomial-time dynamic programming algorithm
0 references
0 references
0 references
