Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127172193, #quickstatements; #temporary_batch_1726312983621 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127172193 / rank | |||
Normal rank | |||
Latest revision as of 12:28, 14 September 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem |
scientific article |
Statements
Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (English)
0 references
30 January 2000
0 references
job-shop
0 references
\(NP\)-hard problem
0 references
pseudo-polynomial algorithm
0 references
0 references
0 references
