Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:36, 1 February 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
