A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632)
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 pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem |
scientific article; zbMATH DE number 4152128
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem |
scientific article; zbMATH DE number 4152128 |
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
0 references
0.9343733
0 references
0.89489317
0 references
0.8908299
0 references
0.88845676
0 references
0.8793271
0 references
0.8761038
0 references
0.87317824
0 references
0.8729257
0 references
