A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:13, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem |
scientific article |
Statements
A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (English)
0 references
1989
0 references
job shop
0 references
unit processing times
0 references
two machines
0 references
pseudo-polynomial algorithms
0 references
