A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(89)90225-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997460775 / rank | |||
Normal rank | |||
Revision as of 22:58, 19 March 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
