An efficient algorithm for the job-shop problem with two jobs (Q1108919)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4068592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the job-shop problem with two jobs |
scientific article; zbMATH DE number 4068592 |
Statements
An efficient algorithm for the job-shop problem with two jobs (English)
0 references
1988
0 references
job-shop scheduling
0 references
two jobs
0 references
shortest path
0 references
obstacles in the plane
0 references
special network
0 references
0 references
0.856219470500946
0 references
0.8500742316246033
0 references
0.8160553574562073
0 references
