A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem |
scientific article; zbMATH DE number 1057107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem |
scientific article; zbMATH DE number 1057107 |
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
0 references
0.8608600497245789
0 references
0.8524689078330994
0 references
0.8458234071731567
0 references
