A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:47, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem |
scientific article |
Statements
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (English)
0 references
4 September 1997
0 references
scheduling problem
0 references
pseudopolynomial-time algorithms
0 references
