On the complexity of minimizing the number of late jobs in unit time open shop (Q1962026): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Open shop problems with unit time operations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On complexity of minimizing weighted number of late jobs in unit time open shops / rank | |||
Normal rank | |||
Latest revision as of 12:29, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of minimizing the number of late jobs in unit time open shop |
scientific article |
Statements
On the complexity of minimizing the number of late jobs in unit time open shop (English)
0 references
30 January 2000
0 references
complexity
0 references
unit time open shop
0 references
unary NP-hard
0 references
